/* -*- coding: utf-8 -*-
 *
 * 3441.cc:  No.3441 Sort Permutation 2 - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<numeric>

using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

using vi = vector<int>;

/* global variables */

int ps[MAX_N], fs[MAX_N];
bool used[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", ps + i), ps[i]--;

  for (int st = 0; st < n; st++)
    if (! used[st]) {
      int u = st;
      vi v;
      while (! used[u])
	used[u] = true, v.push_back(u), u = ps[u];

      int m = v.size(), g = 0;
      for (int i = 0; i < m; i++)
	g = gcd(g, abs(v[i] - v[(i + 1) % m]));
      fs[g] += m - 1;
      //printf(" m=%d, g=%d\n", m, g);
    }

  for (int k = 1; k < n; k++) {
    int sum = 0;
    for (int i = k; i < n; i += k) sum += fs[i];
    printf("%d\n", sum);
  }

  return 0;
}