Polycarp has $n$ coins, the value of the $i$-th coin is $a_i$. Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.

For example, if Polycarp has got six coins represented as an array $a = [1, 2, 4, 3, 3, 2]$, he can distribute the coins into two pockets as follows: $[1, 2, 3], [2, 3, 4]$.

Polycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.


-----Input-----

The first line of the input contains one integer $n$ ($1 \le n \le 100$) — the number of coins.

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 100$) — values of coins.


-----Output-----

Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.


-----Examples-----
Input
6
1 2 4 3 3 2

Output
2

Input
1
100

Output
1

Difficulty: introductory

Starter code:

Solutions:

def mi():
	return map(int, input().split())

from collections import Counter
n = list(mi())[0]
a = Counter(list(mi()))
ma= -1
for i in a:
	if a[i]>ma:
		ma = a[i]
print (ma)

n = input()
c = [ 0 for i in range(101) ]
a = list(map(int, input().split()))
for i in a: c[i] += 1
ans = 0
for i in range(101):
    if c[i] > ans: ans = c[i]
print(ans)


#import math
#import itertools
#from collections import defaultdict, Counter, deque

from collections import Counter

def f(arr):
    cnt = Counter(arr)
    
    return max(cnt.values())


n = int(input())
arr = [int(i) for i in input().split()]
print(f(arr))

from collections import Counter
def go():
    n = int(input())
    a = Counter([int(i) for i in input().split(' ')])
    return max(dict(a).values())

    return

print(go())


import sys

n = int(sys.stdin.readline())
liste = list(map(int, sys.stdin.readline().split()))
seen = [0]*200
maxi = 0
for loop in range(n):
    seen[liste[loop]] += 1
    maxi = max(maxi, seen[liste[loop]])
print(maxi)

n = int(input())
a = [int(x) for x in input().split()]
d = {}
for i in a:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
ans = -1
for i in d:
    ans = max(ans, d[i])
print(ans) 

n = int(input())

lst = [int(x) for x in input().split()]

d = {}
for x in lst:
    if not x in d:
        d[x] = 0
    d[x] += 1

maxi = 0
for (x, y) in list(d.items()):
    maxi = max(maxi, y)

print(maxi)


# -*- coding: utf-8 -*-
"""
Created on Tue Jul  3 16:02:31 2018

@author: Arsanuos
"""

def main():
    rd = lambda: list(map(int, input().split()))
    n = int(input())
    arr = rd()
    h = [0] * 1000
    for item in arr:
        h[item] += 1
    print(max(h))
    
    
    
def __starting_point():
    main()
__starting_point()

n=int(input())
a=list(map(int,input().split()))
d=dict()
for i in a:
    if(i in d):
        d[i]+=1
    else:
        d[i]=1
maxi=0
for i in d:
    maxi=max(maxi,d[i])
print(maxi)

n = int(input().strip())
a = [int(x) for x in input().strip().split(' ')]
v = [0]*101
for i in range(n):
	v[a[i]]+=1
print(max(v))

a = int(input())
b = [int(i) for i in input().split()]
c = [0] * 101
for elem in b:
    c[elem] += 1
print(max(c))


from collections import defaultdict

def main():
	n = int (input())
	a = map(int, input().split())
	count = defaultdict(lambda :0)
	for x in a:
		count[x] += 1
	print(max(count.values()))

main()

n = int(input())
a = [int(c) for c in input().split(" ")]
dic = {}

for num in a:
    if num not in dic:
        dic[num] = 0
    dic[num] += 1

print(max(dic[num] for num in dic))

n = int(input())
s = [int(i) for i in input().split()]

maxT = 0
for i in s:
    t=0
    for j in s:
        if(i == j):
            t+=1
    if(t>maxT):
        maxT = t
print(maxT)

n=int(input())
a=[int(i) for i in input().split()]
p=set([])
for i in range(n):
    p.add(a.count(a[i]))
print(max(p))


n = int(input())
a = list(map(int, input().split()))
k = [0] * 200
for i in range(n):
    k[a[i]] += 1
print(max(k))

import collections
n = int(input())
a = list(map(int,input().split()))
c = collections.Counter(a)
mxm = 0
for i in c:
	if c[i] > mxm:
		mxm = c[i]
print(mxm)

n = int(input())
a = list(map(int, input().split())) + [-1]
a.sort()
mx = 0
c = 0
cur = 0
for i in a:
    if i == c:
        cur += 1
    else:
        c = i
        cur = 1
    mx = max(mx, cur)
print(mx)


n = int(input())
a = [int(i) for i in input().split()]
b = [0] * 101
for i in range(n):
	b[a[i]] += 1

print(max(b))
	
	


n = int(input())
a = [int(x) for x in input().split()]
maxi = 0
for i in a:
    maxi = max(maxi, a.count(i))
print(maxi)

n=int(input())
arr=list(map(int,input().split()))
dict1={}
for i in arr:
    try:
        dict1[i]+=1
    except:
        KeyError
        dict1[i]=1
print(max(dict1.values()))

input()
a = list(map(int, input().split()))

from collections import Counter
c = Counter(a).most_common(1)
print(c[0][1])


t=int(input())
l=[int(x) for x in input().split()]
s=set(l)
p=[l.count(i) for i in s]
print(max(p))


n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(100)]
for i in range(n):
    b[a[i] - 1] += 1
print(max(b))