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


int main() {
    int n;
    vector<int> h;
    cin >> n;
    int newH;
    for (int i = 0; i < n; i++){
        cin >> newH;
        h.push_back(newH);
    }
    
    int numTallest = 0;
    int hTallest = -1;
    for (int i = 0; i<n; i++){
        if (h[i] > hTallest){
            hTallest = h[i];
            numTallest = 1;
        }else if (h[i] == hTallest){
            numTallest++;
        }
    }
    cout << numTallest;        
    return 0;
}