#include <bits/stdc++.h>

using pq = std::priority_queue<int>;

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

    int n;
    std::cin >> n;

    std::vector<std::vector<int>> succ(n + 1);
    for (int i = 2; i <= n; ++i) {
        int p;
        std::cin >> p;
        succ[p].push_back(i);
    }

    std::vector<pq> dp(n + 1);
    auto merge = [&](pq &x, pq &y) {
        if (x.size() < y.size()) {
            x.swap(y);
        }
        while (!y.empty()) {
            x.push(y.top());
            y.pop();
        }
    };

    auto work = [&](int x) {
        if (succ[x].empty()) {
            dp[x].push(1);
            return;
        }
        if (succ[x].size() == 1) {
            dp[x].swap(dp[succ[x][0]]);
            return;
        }

        pq q;
        for (int to : succ[x]) {
            q.push(dp[to].top());
            dp[to].pop();
            merge(dp[x], dp[to]);
        }
        int max = 0;
        for (int _ = 0; _ < 2; ++_) {
            max += q.top();
            q.pop();
        }
        merge(dp[x], q);
        dp[x].push(max);
    };

    for (int i = n; i >= 1; --i) {
        work(i);
    }

    auto &q = dp[1];
    int ans = 0;
    while (!q.empty()) {
        int x = q.top();
        q.pop();
        for (int i = 0; i < x; ++i) {
            ++ans;
            if (i) {
                ++ans;
            }
            std::cout << ans << ' ';
        }
    }
}