def gcd(x,y):
	if not min(x,y):
		return max(x,y)
	while x%y:
		x,y=y,x%y
	return y
		

n=int(input())
p=list(map(lambda x:int(x)-1,input().split()))
a=[0]*n
ans=[0]*(n)
for i in range(n):
	if a[i]:
		continue
	if i==p[i]:
		continue
	c=0;f=0;d=i
	while not a[d]:
		a[d]=1;c=gcd(c,abs(d-p[d]));f+=1
		d=p[d]
	f-=1
	for j in range(1,int(c**0.5)+1):
		if c%j:
			continue
		d=c//j
		ans[j]+=f
		if j!=d:
			ans[d]+=f
for i in range(1,n):
	print(ans[i])