#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

const int N=2e5+5;
vector<int>G[N];
int f[N],n,ans[N],Leaf=0;
vector<int>pos;

void DP(int u){
	for(int x:G[u])DP(x);
	if(G[u].size()==0)return f[u]=1,Leaf++,void();
	if(G[u].size()==1)return f[u]=f[G[u][0]],void();
	sort(G[u].begin(),G[u].end(),[&](int x,int y){return f[x]>f[y];});
	f[u]=f[G[u][0]]+f[G[u][1]];
	for(int i=2;i<G[u].size();i++)pos.emplace_back(f[G[u][i]]);
	// cout<<"dp "<<u<<" f = "<<f[u]<<endl;
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	n=read();
	for(int i=2;i<=n;i++){int p=read();G[p].emplace_back(i);}
	DP(1);pos.emplace_back(f[1]),pos.emplace_back(0);
	sort(pos.begin(),pos.end(),[&](int x,int y){return x>y;});
	ans[1]=1;for(int i=2;i<=Leaf;i++)ans[i]=2;
	for(int i=1;i<pos.size();i++)pos[i]+=pos[i-1];
	for(int x:pos)ans[x+1]=1;
	for(int i=1;i<=Leaf;i++)ans[i]+=ans[i-1];
	for(int i=1;i<=Leaf;i++)cout<<ans[i]<<" ";puts("");

	return 0;
}