#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
//#define int long long
using namespace std;

const int maxn = 310000;

int n;
int fa[maxn];
vector<int>E[maxn];

int f[maxn];
multiset<int>S;
void dfs(const int x)
{
	if((int)E[x].size()==0)
	{
		f[x]=0;
		return;
	}
	if((int)E[x].size()==1)
	{
		auto y=E[x][0];
		f[x]=f[y];
		return;
	}
	
	for(auto y:E[x]) dfs(y);
	vector<int>V;
	for(auto y:E[x]) V.push_back(f[y]);
	sort(V.begin(),V.end());
	
	f[x]=V[0]+V[1]+1;
	for(int i=2,sz=(int)V.size();i<sz;i++)
		S.insert(V[i]);
}

signed main()
{
	ios_base::sync_with_stdio(false);
	
	cin>>n;
	for(int i=2;i<=n;i++)
	{
		cin>>fa[i];
		E[fa[i]].push_back(i);
	}
	dfs(1);
	
	int ans=1;
	cout<<ans;
	S.insert(f[1]);
	auto it=S.end(); it--;
	while(it!=S.begin())
	{
		for(int j=0;j<(*it);j++)
		{
			ans+=2;
			cout<<' '<<ans;
		}
		ans+=1;
		cout<<' '<<ans;
		it--;
	}
	cout<<endl;
	
	return 0;
}