#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int rawInput,n , largest_val , counter = 0; 
    vector<int> nums; 
    cin>>n ; 
    while(n-->0 ){
        cin >> rawInput; 
        nums.push_back(rawInput);
    }
    
    largest_val = 0; 
    for(int i = 0 ; i < nums.size(); i++){
        
        if (largest_val < nums[i]){
            largest_val = nums[i];
            counter = 1;
        }
      else if(largest_val == nums[i]){
             counter++;
            }
            
        
    }
    
    cout << counter <<endl;
        
    return 0;
}