#include <bits/stdc++.h>
using namespace std;
#define M 500005
int A[M],deg[M],n,mark[M];
vector<int>edge[M];
vector<int>B;
int dif[M];
void solve(int rt){
    queue<int>Q,Q2;
    Q.push(rt),mark[rt]=1;
    int s = 0;
    while(!Q.empty()){
        int now=Q.front();Q.pop();
        s++;
        if(!deg[now])Q2.push(now);
        for(int &to:edge[now])
            if(!mark[to])Q.push(to),mark[to]=1;
    }
    int t = 0;
    while(!Q2.empty()){
        int now=Q2.front();Q2.pop();
        t++;
        if((--deg[A[now]]) == 0)Q2.push(A[now]);
    }
    dif[s-t]++;
    dif[s+1]--;
    B.push_back(s);
}
int Ans[M];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&A[i]),deg[A[i]]++;
        edge[i].push_back(A[i]);
        edge[A[i]].push_back(i);
    }
    for(int i=1;i<=n;i++)if(!mark[i])solve(i);
    for(int i=1;i<=n;i++)dif[i]+=dif[i-1];
    sort(B.begin(),B.end());
    reverse(B.begin(),B.end());
    int s = B[0];
    fill(Ans+1,Ans+1+n,-1);
    for(int i=1;i<B.size();i++){
        for(int j=s+1;j<=s+B[i];j++)Ans[j]=i;
        s += B[i];
    }
    for(int i=1;i<=n;i++)
        if(Ans[i]==-1) printf("%d ",dif[i]>0?0:1);
        else printf("%d ",Ans[i]);
    puts("");
    return 0;
}