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


int main() {

	int n, candle;
	int highest = 0;
	cin >> n;
	vector<int> v;

	for (int i = 0; i < n; i++)
	{
		cin >> candle;
		v.push_back(candle);
		highest = v[i] > highest ? v[i] : highest;
	}

	int sum = 0;

	for (auto elem : v)
	{
		if (elem == highest) sum++;
	}	

	cout << sum;
	return 0;
}