Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]

for i in range(1,N+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

for i in range(1,N+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

for i in range(1,N+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

for i in range(1,N+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

#count = 0

#for i in range(1,N+1):
#    for k in range(0,b):
#        if(i == a[k]):
#            count += 1
#    print(count)
#    count = 0

for i in range(1,N+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

count = 0

for i in range(1,N+1):
    for k in range(0,b):
        if(i == a[k]):
            count += 1
    print(count)
    count = 0

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]
b = len(a)

count = 0

for i in range(1,N+1):
    for k in range(0,b):
        if(i == a[k]):
            count += 1
    print(count)
    count = 0


Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]

count = 0

for i in range(1,N+1):
    for k in range(0,len(a)):
        if(i == a[k]):
            count += 1
    print(count)
    count = 0

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

a = [int(N) for N in input().split()]

count = 0

for i in range(1,N+1):
    for k in range(0,len(a)):
        if(i == a[k]):
            count += 1
    print(count)
    count = 0

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
ans = [0]*n
for i in range(n-1):
    ans[a[i]-1] += 1
for j in range(n):
    print(ans[j])