#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n,i,j,tallest;
    cin>>n;
    int a[n];
    for(i=0;i<n;++i)
        cin>>a[i];
    tallest=a[0];
    for(i=1;i<n;++i)
        {
           if(a[i]>tallest)
            {
              tallest=a[i];
               j=i;
            }
        }
    int count=1;
    for(i=0;i<n;++i)
        {
        if(a[i]==tallest && i!=j)
            count++;
    }
    cout<<count<<endl;
    return 0;
}