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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n = 0;
    cin >> n;
    vector<int> heights(n);
    for(int i= 0 ; i < n ; i++)
        cin >> heights[i];

    sort(heights.begin(),heights.end()); 
    vector<int>::iterator first = find(heights.begin(),heights.end(),heights[n-1]);
    vector<int>::iterator last = heights.end();
    vector<int> tallest(first,last);
    cout << tallest.size() << endl;
    return 0;
}