#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];
multiset <ll> s[200005];

void dfs(ll u)
{
    if (A[u].size()==0) {cnt++; 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]);
        for (ll i:s[v]) s[u].insert(i);
    }
    if (s[u].size()==0) s[u].insert(1);
    else
    {
        ll val=*prev(s[u].end());
        s[u].erase(prev(s[u].end()));
        s[u].insert(val+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); vector <ll> ans, c; ans.pb(1);
    for (ll i:s[1]) c.pb(i);
    reverse(c.begin(), c.end());
    for (ll i:c)
    {
        for (ll j=0; j<i; j++)
            ans.pb(2);
        ans.pb(1);
    }
    while (ans.size()<cnt) ans.pb(1);
    ll crr=0;
    for (ll i:ans)
    {
        crr+=i;
        cout << crr << " ";
    }
}