N=int(eval(input()))

*A,=sorted(map(int,input().split()))



import bisect



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

    print((bisect.bisect_right(A,i)-bisect.bisect_left(A,i)))
N=int(eval(input()))

*A,=sorted(map(int,input().split()))



s=[0]*N

for i in A:

    s[i-1]+=1

for t in s:

    print(t)
N = int(eval(input()))
(*A,) = sorted(map(int, input().split()))
import bisect

for i in range(1, N + 1):
    print((bisect.bisect_right(A, i) - bisect.bisect_left(A, i)))

N = int(eval(input()))
(*A,) = sorted(map(int, input().split()))
s = [0] * N
for i in A:
    s[i - 1] += 1
for t in s:
    print(t)

-import bisect - -for i in range(1, N + 1): -    print((bisect.bisect_right(A, i) - bisect.bisect_left(A, i))) +s = [0] * N +for i in A: +    s[i - 1] += 1 +for t in s: +    print(t)