#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 findtallestcandle(vector<int> candles)
{
    int largest = 0;
    for(int i = 0; i < candles.size(); i++)
    {
        if(candles[i] > largest )
            largest = candles[i];
    }
    return largest;
}

int findfrequency(vector<int> candles, int largest)
{
    int counter = 0;
    for(int i = 0; i < candles.size(); i++)
    {
        if(candles[i] == largest )
           counter++;
    }
    return counter;
}

int main(){
    int n;
    cin >> n;
    vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];
    }
    int tallest, frequency;
    tallest = findtallestcandle(height);
    frequency = findfrequency(height, tallest);  
    
    cout << frequency;
    
    return 0;
}