#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;
    cin >> n;
    vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];
    }

    sort(height.begin(), height.end());

    int max = height[n-1];
    int i = n-1;

    int count = 0;

    while(i >= 0)
    {
        if (height[i] == max)
        {
            count++;
        }
        else
        {
            i = -1;
        }

        i--;
    }

    cout << count << endl;

    return 0;
}