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

const int MAX_N = 100000;
int candles[MAX_N];

int main() {
    int n;
    scanf("%d", &n);
    int tallest = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &candles[i]);
        if (candles[i] > tallest) tallest = candles[i];
    }
    int res = 0;
    for (int i = 0; i < n; i++) {
        if (candles[i] == tallest) res++;
    }
    printf("%d\n", res);
    return 0;
}