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


int main() {
    long long n,h[100005];
    long long max=0,count=0;
    cin>>n;
    for(long long i=0;i<n;i++)
    {   cin>>h[i];
        if(h[i]>max){
            max=h[i];
            count=1;
        }
        else if(h[i]==max)
            count++;
            
    }
    cout<<count<<endl;
    return 0;
}