#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()

template <typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;} return false;}
template <typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;} return false;}


int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n; cin >> n;
  vector<int> a(n);
  rep(i,0,n) cin >> a[i], a[i]--;
  vector<vector<int>> cycle;
  vector<bool> seen(n,false);
  rep(i,0,n){
    if(seen[i]) continue;
    vector<int> c;
    c.push_back(i);
    int now=i;
    seen[now]=true;
    while(a[now] != c[0]){
      now=a[now];
      c.push_back(now);
      seen[now]=true;
    }
    cycle.push_back(c);
  }
  vector<int> ans(n);
  rep(i,0,cycle.size()){
    if(cycle[i].size() == 1) continue;
    int g=abs(cycle[i][0]-cycle[i].back());
    rep(j,0,cycle[i].size()-1){
      g=gcd(g,abs(cycle[i][j]-cycle[i][j+1]));
    }
    ans[g]+=cycle[i].size()-1;
  }
  for(int p=1;p<n;p++){
    for(int q=2;p*q<n;q++){
      ans[p]+=ans[p*q];
    }
  }
  rep(i,1,n) cout << ans[i] << '\n';
}