#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,m;
    cin >> n;
    int count = 0;
    int max = 0;
    for(int height_i = 0;height_i < n;height_i++)
    {
        cin >> m;
        if (m > max)
        {
            max = m;
            count = 1;
        }
        else if (m == max)
            count++;
    }   
    cout << count << endl;
    return 0;

}