Buggy python submission (verdict: Runtime Error):
N = int(input())
A =[int(i) for i in input().split()]
b = [0]*N
for i in A:
  result[i-1]+=1
for i in range(N):
    print(b[i])


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(n) for n in input().split()]
for i in range(N):
	A_init = A
	A = [n for n in A if n != i+1]
	print(len(A_init) - len(A))

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  A_init=A
  A=[n for n in A if n!=i+1]
  print(len(A_init)-len(A))

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
	A_init = A
	A = [n for n in A if n != i+1]
	print(len(A_init) - len(A))

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  count = 0
  for j in range(len(A)):
	if i+1 == A[j]:
	  count += 1
  A.pop(i+1)
  print(count)

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
for i in range(N):
  count = 0
  for j in range(N-1):
    if i+1 == int(A[j]):
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
for i in range(N):
  count = 0
  for j in range(N-1):
    if i+1 == int(A[j]):
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
for i in range(N):
  count = 0
  for j in range(N-1):
    aj = int(A[j])
    if i+1 == aj:
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
for i in range(N):
  count = 0
  for j in range(N-1):
    if i+1 == int(A[j]):
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
for i in range(N):
  count = 0
  for j in range(N-1):
	if i+1 == int(A[j]):
	  count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
for i in range(N):
  count=0
  for j in range(N-1):
	if i+1==int(A[j]):
	  count+=1
  print(count)

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  count = 0
  for j in range(N-1):
    if i+1 == A[j]:
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
def c_163():
	N = int(input())
	A = input().split()
	A = [int(n) for n in A]
	for i in range(N):
		count = 0
		for j in range(N-1):
			if i+1 == A[j]:
				count += 1
		print(count)

c_163()

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  count = 0
  for j in range(N-1):
    if i+1 == A[j]:
      count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  count = 0
  for j in range(N-1):
	if i+1 == A[j]:
	  count += 1
  print(count)


Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])

Buggy python submission (verdict: Runtime Error):
A = input().split()
A = [int(n) for n in A]
for i in range(N):
  count = 0
  for j in range(N-1):
	if i+1 == A[j]:
	  count += 1
  print(count)

Fixed submission:
N = int(input())
A =[int(n) for n in input().split()]
b = [0]*N
for i in A:
  b[i-1]+=1
for i in range(N):
  print(b[i])