#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int gcd(int a,int b){
    if(a<b) return gcd(b,a);
    if(b==0) return a;
    return gcd(a % b,b);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<int> p(n);
    for(int i = 0;i<n;i++) cin>>p[i];
    for(int i = 0;i<n;i++) p[i]--;
    vector<int> vis(n, 0);
    vector<int> ans(n, 0);
    
    for(int i = 0;i<n;i++){
        if(vis[i]) continue;
        int ni = i;
        int now = 0;
        int k = 0;
        while(true){
            if(vis[ni]++) break;
            k++;

            int nj = p[ni];
            
            now = gcd(now, abs(ni - nj));
            ni = nj;
        }
        ans[now] += k - 1;
    }
    for(int i = 1;i<n;i++) {
        for(int j = 2 * i;j<n;j+=i) ans[i] += ans[j];
    }
    for(int i = 1;i<n;i++) cout<<ans[i]<<endl;
}