import sys

cases = int(input().strip())
types = list(map(int, input().strip().split(' ')))

biggest = 0
for i in range(0, len(types)):
    temp = 0
    for k in range(0, len(types)):
        if types[i] is types[k]:
            temp += 1
    if biggest < temp or (biggest is temp and biggest is types[i]):
        biggest = temp
print(biggest + 1)