#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define lli long long int


int main() {
    lli n, a[100000], count;
    lli value, j;
    count = 0;
    cin >> n;
    for(lli i = 0; i < n; i++)
        cin >> a[i];
    sort(a, a + n);
    value = a[n - 1];
    j = 0;
    while(value == a[n - 1 - j]){
        count++;
        j++;
    }
    cout << count;
    return 0;
}