#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 checker(int number_of_candles, vector<int> height_of_candles){
    int max_height{0};
    int number_of_blowed{0};
    for(int order = 0; order < number_of_candles; order++){
        if (height_of_candles[order] > max_height){
            max_height = height_of_candles[order];
            number_of_blowed = 1;
        }
        else if(height_of_candles[order] == max_height)
            number_of_blowed++;
    }
    return number_of_blowed;
}

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