#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(){
    int n;
   
    int c;
    cin >> n;
    int x;
    vector<int> height;
    vector<int>::iterator t;
    for(int height_i = 0;height_i < n;height_i++){
       cin>>x;
        height.push_back(x);
    }
    t=max_element(height.begin(),height.end());
    c=count(height.begin(),height.end(),*t);
    cout<<c;
    return 0;
}