#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	int n;
	cin>>n;
	vector<int> p(n);
	for(int i=0;i<n;i++)cin>>p[i],p[i]--;
	vector<int> d(n+1);
	vector<bool> seen(n);
	for(int i=0;i<n;i++){
		if(seen[i])continue;
		if(p[i]==i)continue;
		int g=0;
		int now=i;
		int cnt=0;
		do{
			int nxt=p[now];
			g=gcd(g,abs(nxt-now));
			now=nxt;
			cnt++;
			//cout<<now<<endl;
			seen[now]=true;
		}while(now!=i);
		d[g]+=cnt-1;
	}
	for(int i=1;i<n;i++){
		int ans=0;
		for(int j=i;j<=n;j+=i)ans+=d[j];
		cout<<ans<<endl;
	}
}