#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);
    int count = 0;
    int h = 0;
    int v = 0;
    for(int i = 0;i < n;i++){
        cin >> v;
        if(i==0){
            count++;
            h=v;
            continue;
        }
        if(v>h){
            h=v;
            count=1;
        }else if(v==h){
            count++;
        }
    }
    cout << count << endl;
    return 0;
}