#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int gcd(int a,int b)
{
	while(b)
	{
		int t=a%b;
		a=b;
		b=t;
	}
	return a;
}
int N,P[2<<17];
bool vis[2<<17];
int ans[2<<17];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N;
	for(int i=1;i<=N;i++)cin>>P[i];
	for(int i=1;i<=N;i++)if(!vis[i])
	{
		vector<int>U;
		int u=i;
		while(!vis[u])
		{
			vis[u]=true;
			U.push_back(u);
			u=P[u];
		}
		sort(U.begin(),U.end());
		int g=0;
		for(int j=1;j<U.size();j++)g=gcd(g,U[j]-U[j-1]);
		for(int k=1;k*k<=g;k++)if(g%k==0)
		{
			ans[k]+=U.size()-1;
			if(k*k<g)ans[g/k]+=U.size()-1;
		}
	}
	for(int k=1;k<=N-1;k++)cout<<ans[k]<<"\n";
}