#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5 + 100;
vector<int> g[MAXN];
int dp[MAXN];

void solve_() {
    int n;
    cin >> n;
    for (int i = 1; i < n; ++i) {
        int p;
        cin >> p;
        --p;
        g[p].push_back(i);
    }
    vector<int> opt;
    for (int i = n - 1; i >= 0; --i) {
        if (g[i].empty()) {
            dp[i] = 1;
            continue;
        }
        if ((int)g[i].size() == 1) {
            dp[i] = dp[g[i][0]];
            continue;
        }
        sort(g[i].begin(), g[i].end(), [](int u, int v) { return dp[u] > dp[v]; });
        dp[i] = dp[g[i][0]] + dp[g[i][1]];
        for (int j = 2; j < (int)g[i].size(); ++j) {
            opt.push_back(dp[g[i][j]]);
        }
    }
    sort(opt.rbegin(), opt.rend());
    vector<int> ans;
    int cnt = 0;
    for (int i = 0; i < dp[0]; ++i) {
        ans.push_back(2 * ans.size() + 1 - cnt);
    }
    ++cnt;
    for (int _ = 0; _ < (int)opt.size(); ++_, ++cnt) {
        for (int i = 0; i < opt[_]; ++i) {
            ans.push_back(2 * ans.size() + 1 - cnt);
        }
    }
    for (int x : ans) {
        cout << x << " ";
    }
    cout << "\n";
}

/// #define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}