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


int main() {
    int n;
    int max = 0;
    int count = 0;
    
    cin >> n;
    vector <int> heights(n);
    
    for (int i = 0; i<n; i++) {
        cin >> heights[i];
        if (heights[i] > max) {
            max = heights[i];
        }
    }
    
    for (int j = 0; j<n; j++)
        if (max==heights[j])
            count++;
    cout << count;
    return 0;
}