#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <array>

using namespace std;

const int N = 2e5 + 3;

int n;
vector<int> adj[N];
int p[N];

int a[N], b[N];

void solve(int u){
    int sum = 0, cnt = 0;
    for(int to: adj[u]){
        solve(to);
        if(!b[to]) continue;
        sum += a[to];
        ++cnt;
        b[u] += b[to];
    }

    if(!adj[u].size()){
        a[u] = 0;
        b[u] = 1;
        return;
    }

    a[u] = sum + (cnt > 1);
    // cout << a[u] << " " << u << " a" << endl;
    // cout << b[u] << " b" << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 2; i <= n; ++i){
        cin >> p[i];
        adj[p[i]].push_back(i);
    }

    solve(1);

    for(int i = 0; i < b[1]; ++i){
        if(i <= a[1]){
            cout << (i + (i + 1)) << " ";
        }
        else{
            cout << (a[1]) + i + 1 << " ";
        }
    }
    cout << "\n";
}