from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

from math import gcd
N = int(input())
P = list(map(lambda x:int(x)-1,input().split()))
uf = UnionFind(N)
for i in range(N):
    uf.union(i,P[i])

d = uf.all_group_members()
a = [0] * N
for i in d:
    GCD = 0
    for j in range(len(d[i])-1):
        GCD = gcd(GCD, d[i][j+1] - d[i][j])
    a[GCD] += len(d[i]) - 1

ans = [0] * N
for i in range(1,N):
    now = i
    while(now < N):
        ans[i] += a[now]
        now += i
print("\n".join(map(str,ans[1:])))