#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200013;
priority_queue<int>pq[N];
vector<int>mp[N];

void dfs(int x){
    if(mp[x].empty()){pq[x].push(0);return;}
    int k=0;
    int mx[2]={-1,-1},v;
    for(auto i:mp[x]){
        dfs(i);
        if(!pq[i].empty()){
            k=pq[i].top();
            if(k>mx[0])mx[1]=mx[0],mx[0]=k;
            else if(k>mx[1])mx[1]=k;
        }
    }
    if(mx[1]!=-1)k=1,v=1+mx[0]+mx[1];else k=0;
    for(auto i:mp[x]){
        if(k){
            if(!pq[i].empty()){
                if(pq[i].top()==mx[0])mx[0]=-1,pq[i].pop();
                else if(pq[i].top()==mx[1])mx[1]=-1,pq[i].pop();
            }
        }
        if(pq[i].size()>pq[x].size())swap(pq[x],pq[i]);
        while(!pq[i].empty())pq[x].push(pq[i].top()),pq[i].pop();
    }
    if(k)pq[x].push(v);
}

void solve(){
    int n;
    cin>>n;
    for(int i=1,x;i<n;i++)cin>>x,mp[x].push_back(i+1);
    dfs(1);
    int ans=0;
    while(!pq[1].empty()){
        int x=pq[1].top();
        pq[1].pop();
        ans++,cout<<ans<<' ';
        while(x--)ans+=2,cout<<ans<<' ';
    }
    cout<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T=1;
    //cin>>T;
    while(T--)solve();
}