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

int compare(const void *e1, const void *e2)
{
    return (*(unsigned int *)e1 - *(unsigned int *)e2);
}

int main() {
    
    unsigned int * ht;
    unsigned int nc, count = 0;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    scanf("%d\n", &nc);
    
    ht = (unsigned int *)malloc(nc * sizeof(int));
    
    for (int i = 0; i < nc; i++)
        scanf("%d ", &ht[i]);
    
    qsort(ht, nc, 4, compare);
    for (int i = nc-1; i >= 0; i--) {
        count++;
        if (ht[i] != ht[i-1])
            break;
    }
    
    printf("%d\n", count);
    free(ht);
    return 0;
}