#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];
    }
    
    unordered_map<int,int> highest;
    int highest_int = height[0]; 
    highest[highest_int] = 1; 
    
    for(int i = 1; i < (int) height.size(); ++i){
      
        if(height[i] == highest_int) {
            
            highest[highest_int] +=1;
        }

        else if (height[i] > highest_int){
           
            highest.erase(highest_int); 
            highest_int = height[i]; 
            highest[highest_int] = 1; 
            
        } 
        else continue; 
          
    }

    cout<<highest[highest_int]<<endl; 
    
}