#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define all(p) p.begin(),p.end()
using ll =long long;

void solve(){
    int N;
    cin>>N;
    vector<int> pare(N,-1),h(N);
    vector<vector<int>> G(N);
    rep(i,0,N-1){
        int a;
        cin>>a;
        a--;
        h[a]++;
        pare[i+1]=a;
        G[a].push_back(i+1);
    }
    int M=0,L=0;
    rep(i,0,N){
        if(h[i]!=1) M++;
        if(h[i]==0) L++;
    }
    vector<vector<int>> H(N);
    vector<int> wei(N);
    vector<int> q;
    for(int i=N-1;i>=0;i--){
        if(H[i].empty()){
            H[i].push_back(1);
        }
        sort(all(H[i]));
        reverse(all(H[i]));
        if(int(H[i].size())>2){
            rep(j,2,H[i].size()){
                q.push_back(H[i][j]);
            }
        }
        H[i].push_back(0);
        if(i!=0){
            H[pare[i]].push_back(H[i][0]+H[i][1]);
        }
        else q.push_back(H[i][0]+H[i][1]);
    }
    sort(all(q));
    reverse(all(q));
    vector<int> ans(L,2);
    int sum=0;
    for(auto x:q){
        ans[sum]--;
        sum+=x;
    }
    rep(i,0,L){
        if(i){
            cout<<" ";
            ans[i]+=ans[i-1];
        }
        cout<<ans[i];
    }
    cout<<"\n";
}

int main(){
    int T=1;
    //cin>>T;
    while(T--) solve();
}