#include<bits/stdc++.h>

#pragma GCC optimize ("Ofast")

using namespace std;

#define rep(i,a,b) for(ll i = a; i<b;i++)
#define rrep(i,a,b) for(ll i = b-1; i>=a;i--)
#define trav(x,a) for(auto &x: a)
#define all(v) v.begin(),v.end()
#define sz(v) ll(v.size())

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    ll n; cin>>n;

    vector<vl> e(n);
    rep(i,1,n) {
        ll p; cin>>p;
        e[p-1].push_back(i);
    }

    ll leaves = 0;

    vl mem(n);
    
    function<ll(ll)> rec = [&](ll v) {
        if(sz(e[v])==0){
            leaves ++;
            return mem[v] = 1ll;
        }
        vl chAns;
        for(auto u: e[v]){
            chAns.push_back(rec(u));
        }
        sort(all(chAns));
        ll ans = chAns.back();
        if(sz(chAns)>1) ans += chAns[sz(chAns)-2];
        return mem[v] = ans;
    };

    rec(0);
    set<pll> q;

    function<void(ll)> genans = [&](ll v) {
        if(sz(e[v])==0){
            return;
        }
        vector<pll> chAns;
        for(auto u: e[v]){
            chAns.emplace_back(mem[u],u);
        }
        sort(all(chAns));
        rep(i,0,sz(chAns)){
            if(i>=sz(chAns)-2){
                genans(chAns[i].second);
            } else {
                q.emplace(chAns[i].first,chAns[i].second);
            }
        }
        return;
    };

    q.emplace(mem[0],0);

    vl ans;
    while(q.size()){
        auto [g,v] = *prev(q.end());
        q.erase(prev(q.end()));
        genans(v);
        ans.push_back(g);
    }
    ll a = 0;
    for(auto x: ans){
        a += 1;
        cout<<a<<" ";
        rep(i,0,x-1){
            a += 2;
            cout<<a<<" ";
        }
    }
    cout<<endl;
}