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


int main() {
    int nCandles;
    cin >> nCandles;
    int bCake[nCandles + 1];
    for (int i = 0; i < nCandles; i++)
        cin >> bCake[i];
    int max = *max_element(bCake, bCake + nCandles);
    
    int count = 0;
    for (int i = 0; i < nCandles; i++){
        if (bCake[i] == max)
            count++;
    }
        
    cout << count << endl;
    
    return 0;
}