import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto P = new int[N];
      foreach (u; 0 .. N) P[u] = readInt - 1;
      
      auto vis = new bool[N];
      auto rss = new int[][N + 1];
      foreach (r; 0 .. N) if (!vis[r]) {
        int[] cyc;
        for (int u = r; !vis[u]; u = P[u]) {
          vis[u] = true;
          cyc ~= u;
        }
        debug writeln(cyc);
        const len = cast(int)(cyc.length);
        foreach (j; 0 .. len) rss[abs(cyc[(j + 1) % len] - cyc[j])] ~= r;
      }
      debug writeln("rss = ", rss);
      
      auto cnt = new int[N];
      foreach (d; 1 .. N + 1) {
        int ans;
        for (int e = d; e <= N; e += d) {
          foreach (r; rss[e]) {
            ans -= max(cnt[r] - 1, 0);
            ++cnt[r];
            ans += max(cnt[r] - 1, 0);
          }
        }
        writeln(ans);
        for (int e = d; e <= N; e += d) {
          foreach (r; rss[e]) {
            --cnt[r];
          }
        }
      }
      
    }
  } catch (EOFException e) {
  }
}