#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>  
#include <cassert>
#include <iostream>
using namespace std;
void insertionSort(int ar_size, int *ar) {
    int key = 0;
   
    for (int i = 1; i < ar_size; i++)
        {
            int j = i-1;
            key = ar[i];
                while(j>=0 & ar[j]>key)
                {
                   ar[j+1] = ar[j];
           
                   j--;    
                }
            ar[j+1] = key;    
        }
}

int num_of_tallest_candles(int ar_size, int *ar){
    int tallest = ar[ar_size - 1];
    int count = 1;
    int i = ar_size - 2;
    while(tallest == ar[i])
        {
        count++;
        i--;
    }
    //cout<<count;
    
    return count;
}    

int main(void) {
   
    int _ar_size;
    cin >> _ar_size;
    //scanf("%d", &_ar_size);
    int _ar[_ar_size], _ar_i;
    for(_ar_i = 0; _ar_i < _ar_size; _ar_i++) { 
        cin >> _ar[_ar_i];
        //scanf("%d", &_ar[_ar_i]); 
    }

   insertionSort(_ar_size, _ar);
   cout<<num_of_tallest_candles(_ar_size, _ar);
   
   return 0;
}