#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n;
	cin >> n;
	vector<int> p(n);
	rep(i, 0, n) cin >> p[i], p[i]--;
	vector<int> cnt(n + 1), f(n);
	rep(i, 0, n) {
		if (f[i]) continue;
		f[i] = 1;
		int g = 0;
		int ln = 0;
		int j = p[i];
		while (j != i) {
			f[j] = 1;
			g = gcd(g, abs(i - j));
			ln++;
			j = p[j];
		}
		cnt[g] += ln;
	}
	rep(i, 1, n) {
		ll tmp = 0;
		for (int j = i; j <= n; j += i) tmp += cnt[j];
		cout << tmp << '\n';
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}