#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
   long int n;
    cin >> n;
    vector<long int> height(n);
    for(long int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];
    }
    long int max1=0,count=0;
    for(long int i=0;i<n;i++)
        {
        if(height[i]>max1)
            {
            max1=height[i];
            count=1;
        }
        else
            if(height[i]==max1)
            count++;
            
        
    }
    cout<<count;
    return 0;
}