#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int n, tot, stk[maxn], tp, vis[maxn], bel[maxn], sz[maxn], a[maxn];
void Dfs(int u) {
    stk[++ tp] = u;
    vis[u] = 1;
    if(!vis[a[u]])
        Dfs(a[u]);
    else if(!bel[a[u]]) {
        ++ tot;
        do {
            int v = stk[tp --];
            bel[v] = tot;
            ++ sz[tot];
            if(v == a[u])
                break;
        }while(1);
    }
    if(stk[tp] == u) {
        bel[u] = ++ tot;
        sz[tot] = 1;
        -- tp;
    }
}
vector<int> G[maxn], len;
int dep[maxn], fa[maxn], son[maxn], dif[maxn], ans[maxn], mx;
void Solve(int u) {
    dep[u] = dep[fa[u]] + 1;
    son[u] = u;
    for(auto v : G[u]) {
        Solve(v);
        if(dep[son[u]] < dep[v])
            son[u] = v;
    }
}
void Add(int u) {
    len.push_back(dep[son[u]] - dep[u] + sz[u]);
    for(auto v : G[u])
        if(v != son[u])
            Add(v);
}
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++ i) {
        scanf("%d", &a[i]);
    }
    for(int i = 1; i <= n; ++ i) {
        if(!vis[i]) {
            Dfs(i);
        }
    }
    for(int i = 1; i <= n; ++ i) {
        if(bel[i] != bel[a[i]]) {
            G[bel[a[i]]].push_back(bel[i]);
            fa[bel[i]] = bel[a[i]];
        }
    }
    for(int i = 1; i <= tot; ++ i) {
        if(!fa[i]) {
            Solve(i);
            mx = max(mx, dep[son[i]] - dep[i] + sz[i]);
            ++ dif[sz[i]];
            -- dif[sz[i] + dep[son[i]] - dep[i] + 1];
            Add(i);
        }
    }
    sort(len.begin(), len.end(), greater<int>());
    int now = len[0];
    for(int i = 1; i < (int)len.size(); ++ i) {
        for(int j = now + 1; j <= now + len[i]; ++ j)
            ans[j] = i;
        now += len[i];
    }
    for(int i = 1; i <= n; ++ i) {
        dif[i] += dif[i - 1];
        if(i <= mx && !dif[i])
            ans[i] = 1;
        printf("%d ", ans[i]);
    }
    puts("");
}