#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;
bool is_valid_height(int value){
	return (value >= 1 && (value <= pow(10, 7)));
}
int highest(vector<int>& candles){
	vector<int>::iterator last, first;
	first = candles.begin(); last = candles.end();
	int highest = *first;
	while (first != last){
		if (*first > highest && is_valid_height(highest))
			highest = *first;
		++first;
	
	}
	return highest;
}

int match_height(int highest_candle, const vector<int>& candles){

	int matches = 0;
	for_each(candles.begin(), candles.end(), [&](int height){if (height == highest_candle){ ++matches; }});
	return matches;
}

int main(){
    int n;
    cin >> n;
    vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];
    }
    cout << match_height(highest(height),height) << endl;
    return 0;
}