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

int num_candles(vector<int> candles) {
    sort(candles.begin(), candles.end());
    int result = 1;
    size_t n = candles.size();
    while (candles[n - 1] == candles[n - 2]) {
        result++;
        n--;
    }
    return result;
}

int main() {
    int n;
    cin >> n;
    vector<int> candles;
    for (int i = 0; i < n; i++) {
        int h;
        cin >> h;
        candles.push_back(h);
    }
    cout << num_candles(candles) << endl;
    return 0;
}