import collections

n=int(eval(input()))

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

m=max(a)

c=collections.Counter(a)

c=c.most_common()

l=[0]*n

for i in range(len(c)):

    l[c[i][0]-1]=c[i][1]

print((l[0]))

for j in range(1,n):

    print((l[j]))

n=int(eval(input()))

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

l=[0]*(n+1)

check=[False]*(n+1)



for i in a:

  l[i]+=1

for i in range(1,n+1):

  print((l[i]))
import collections

n = int(eval(input()))
a = list(map(int, input().split()))
m = max(a)
c = collections.Counter(a)
c = c.most_common()
l = [0] * n
for i in range(len(c)):
    l[c[i][0] - 1] = c[i][1]
print((l[0]))
for j in range(1, n):
    print((l[j]))

n = int(eval(input()))
a = list(map(int, input().split()))
l = [0] * (n + 1)
check = [False] * (n + 1)
for i in a:
    l[i] += 1
for i in range(1, n + 1):
    print((l[i]))

-import collections - -m = max(a) -c = collections.Counter(a) -c = c.most_common() -l = [0] * n -for i in range(len(c)): -    l[c[i][0] - 1] = c[i][1] -print((l[0])) -for j in range(1, n): -    print((l[j])) +l = [0] * (n + 1) +check = [False] * (n + 1) +for i in a: +    l[i] += 1 +for i in range(1, n + 1): +    print((l[i]))