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


int main() {
    
    vector <long long> v;
vector <long long> :: iterator i;
long long n,m;
cin>>n;

for(long long j=0;j<n;j++)
{
cin>>m;
v.push_back(m);
}
sort(v.begin(),v.end());
long long max=v[n-1];
int ct=1;
while(v[n-2]==max)
{
    n--;
    ct++;
}
cout<<ct;

    return 0;
}