#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(int argc, char const *argv[])
{
	ios::sync_with_stdio(0);

	vector<int> candles;
	int n;
	int cur;

	cin >> n;


	for (int i = 0; i < n; ++i) {
		cin >> cur;
		candles.push_back(cur);
	}

	sort (candles.begin(), candles.end(), greater<int>());

	int i = 0;
	int cont = 0;
	int max = candles[i];

	while (candles[i] == max) {
		cont++;
		i++;
	}

	cout << cont << '\n';

	return 0;
}