#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int N=500005;
int a[N],n,T,fm[N],st[N],tp,vis[N],tg[N],son[N],h[N];
int cf[N],ans[N],mx,mxx,val[N],ti,I,cl[N],d[N],md[N],cnt;
struct edge{int to,next;}w[N<<1];
vector<int>C[N];
struct node{int to,next;};
void Add(int x,int y){
//	printf("%d %d\n",x,y);
	w[++cnt].to=y,w[cnt].next=h[x],h[x]=cnt;
}
void Fnd(int x){
	st[++tp]=x;vis[x]=ti;
	if(!vis[a[x]])Fnd(a[x]);
	else{
		if(vis[a[x]]!=ti)return;
		int y,c=0;I++;
		do{y=st[tp];cl[y]=I;tp--,C[I].push_back(y);}while(y!=a[x]);
		return;
	}
}
void DFS1(int u,int ff){
	d[u]=d[ff]+val[u];md[u]=d[u];
	for(int i=h[u];i;i=w[i].next){
		int e=w[i].to;
		if(e==ff)continue;DFS1(e,u);
		if(md[e]>md[son[u]])son[u]=e;
		md[u]=max(md[u],md[e]);
	}
}
void DFS2(int u,int dp){
	if(son[u])DFS2(son[u],dp+val[son[u]]);
	else st[++tp]=dp,mx=max(mx,dp);
	for(int i=h[u];i;i=w[i].next){
		int e=w[i].to;
		if(e!=son[u])DFS2(e,val[e]);
	}
}
bool cmp(int a,int b){return a>b;}
int main(){
	int i;
	scanf("%d",&n);
	for(i=1;i<=n;i++)scanf("%d",&a[i]);
	for(i=1;i<=n;i++){if(!vis[i]){tp=0;ti++;Fnd(i);}}
	for(i=1;i<=n;i++){
		if(cl[i])continue;
		if(cl[a[i]])Add(cl[a[i]]+n,i);
		else Add(a[i],i);
	}
	for(i=1;i<=n;i++)val[i]=1;tp=0;
	for(i=n+1;i<=n+I;i++)val[i]=C[i-n].size();
	for(i=n+1;i<=n+I;i++){
		mx=0;DFS1(i,0);DFS2(i,val[i]);
		cf[val[i]]++;cf[mx+1]--;//printf("~%d\n",mx);
		mxx=max(mxx,mx);
	}
	for(i=1;i<=n;i++){
		cf[i]+=cf[i-1];
		if(cf[i])ans[i]=0,tg[i]=1;
		else if(i<=mxx)ans[i]=1,tg[i]=1;
	}
	sort(st+1,st+1+tp,cmp);
	int sc=0;
	for(i=1;i<=tp;i++)sc+=st[i],fm[sc]=i-1;
	for(i=1;i<=n;i++){
		if(!fm[i])fm[i]=fm[i-1];
		if(!tg[i])ans[i]=fm[i];
		printf("%d ",ans[i]);
	}
}