#include<bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for (int i = 1; i < n; ++i) {
        int p;
        cin >> p;
        g[p - 1].push_back(i);
    }
    vector<pair<int, int>> ss;
    auto dfs = [&](auto dfs, int u, int d) -> void {
        ss.emplace_back(d, u);
        for (auto to : g[u]) {
            dfs(dfs, to, d + 1);
            ss.emplace_back(d, u);
        }
    };
    dfs(dfs, 0, 0);
    pair<int, int> mn = {1e9, -1};
    vector<int> qq;
    bool q = 0;
    for (int i = 0; i < ss.size(); ++i) {
        if (g[ss[i].second].empty()) {
            if (q) {
                qq.push_back(mn.second);
            }
            q = 1;
            mn = {1e9, 1};
        }
        mn = min(mn, ss[i]);
    }
    sort(qq.begin(), qq.end());
    qq.resize(unique(qq.begin(), qq.end()) - qq.begin());
    int cnt = 0, cnt2 = 0;
    for (int i = 0; i < n; ++i) cnt += g[i].empty();
    for (int i = 0; i < n; ++i) cnt2 += g[i].size() > 1;
    assert(qq.size() == cnt2);
    for (int i = 1; i <= cnt; ++i) {
        cout << i + min(i - 1, (int)qq.size()) << ' ';
    }
}