#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 main(){
    int n;
    cin >> n;
    vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++)
    {
       cin >> height[height_i];
    }
    std::set<int> candleset (height.begin(),height.end());
    std::set<int> ::iterator it = candleset.end();
    //find last element as it is largest
    int largestcandle=*(--it);
    //find how many of the largest in the vector
    int countt = std::count (height.begin(), height.end(), largestcandle);
    cout<<countt<<endl;
    return 0;
}