#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 get_max_candles(vector<int> height){
    std::sort(height.begin(), height.end());
    std::pair<std::vector<int>::iterator,std::vector<int>::iterator> bounds;
    bounds = std::equal_range (height.begin(), height.end(), *height.rbegin());
    return bounds.second - bounds.first;    
}

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