#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

ll cnt;
vector <ll> A[200005];
priority_queue <ll> s[200005];

void dfs(ll u)
{
    if (A[u].size()==0)
    {
        s[u].push(0);
        return;
    }
    if (A[u].size()==1)
    {
        dfs(A[u][0]);
        swap(s[A[u][0]], s[u]);
        return;
    }
    for (ll v:A[u])
    {
        dfs(v);
        if (s[v].size()>s[u].size())
            swap(s[v], s[u]);
        while (s[v].size()) 
            s[u].push(s[v].top()), s[v].pop();
    }
    ll val=s[u].top(); s[u].pop();
    ll val1=s[u].top(); s[u].pop();
    s[u].push(val+val1+1);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n; cin >> n;
    for (ll i=2; i<=n; i++)
    {
        ll x; cin >> x;
        A[x].pb(i);
    }
    dfs(1); ll crr=0;
    while (s[1].size())
    {
        ll u=s[1].top(); s[1].pop();
        crr++, cout << crr << " ";
        for (ll i=0; i<u; i++)
            crr+=2, cout << crr << " ";
    }
}