#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>p(n);
	rep(i, n)cin >> p[i], p[i]--;
	vector<bool>chk(n);
	vector tmp(n, vector<int>());
	rep2(i, 1, n) {
		for (int j = i; j < n; j += i)tmp[j].push_back(i);
	}
	vector<int>ans(n);
	rep(i, n) {
		if (chk[i])continue;
		int x = i;
		vector<int>d;
		while (!chk[x]) {
			chk[x] = true;
			int nx = p[x];
			d.push_back(abs(x - nx));
			x = nx;
		};
		map<int, int>mp;
		for (auto e : d) {
			for (auto x : tmp[e])mp[x]++;
		}
		int sz = d.size();
		for (auto[k, v] : mp) {
			if (v == sz)ans[k] += v - 1;
		}
	}
	rep2(i, 1, n)cout << ans[i] << endl;
	return 0;//おもい？
}