#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(){
    long long n, q, count = 0, tallest = 0;
    cin >> n;
    for(int x = 0;x<n;x++){
        cin >> q;
        if(q>tallest){
            tallest = q;
            count =1;
        }
        if(q==tallest){
            count++;
        }
    }
    cout << count-1;
    return 0;
}