#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;


int main(){
    int n;
	int big = 0;
	int max;
	int numc;
	cin >> n;
	//Dynamically allocate memory and save the address of that memory in the pointer
	int *array = new int[n]; 

	//read in all elements into array
	for (int i = 0; i < n; i++){
		cin >> array[i];
	}
	max = array[0];

	for (int j = 0; j < n; j++){
		if (max<array[j])
		{
			max = array[j];
		}
	}
	numc = array[0];
	for (int k = 0; k < n; k++){
		if (max == array[k])
		{
			big++;
		}
	}
	//cout << "The max is : " << mx << endl;
	cout << big << endl;
    return 0;
}