#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;

    function<ll(ll)> rec = [&](ll v) {
        if(sz(e[v])==0){
            leaves ++;
            return 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 ans;
    };

    ll goods = rec(0);

    rep(i,0,goods){
        cout<<i*2+1<<" ";
    }
    rep(i,goods,leaves){
        cout<<goods*2+(i-goods)<<" ";
    }
    cout<<"\n";
}