#include <bits/stdc++.h>

using namespace std;

constexpr int N = 2e5;

vector<int> nei[N];

template <typename Q>
auto& getc(Q&& q) {
  struct H: decay_t<Q> { decay_t<Q>::c; };
  return q.*&H::c;
}

priority_queue<int> solve(int v) {
  if (nei[v].empty()) return priority_queue<int>{less<int>{}, {0}};
  if (nei[v].size() == 1) return solve(nei[v][0]);
  vector<priority_queue<int>> ch;
  for (auto u: nei[v]) ch.push_back(solve(u));
  priority_queue<int> ans;
  int mx0 = -1, mx1 = -1;
  for (int i = 0; i < ch.size(); ++i) !~mx0 || ch[mx0].top() < ch[i].top()? mx1 = mx0, mx0 = i: !~mx1 || ch[mx1].top() < ch[i].top()? mx1 = i: i;
  int mrg = ch[mx0].top() + ch[mx1].top() + 1;
  ch[mx0].pop(), ch[mx1].pop();
  mx0 = -1;
  for (int i = 0; i < ch.size(); ++i) !~mx0 || ch[mx0].size() < ch[i].size()? mx0 = i: i;
  ans = move(ch[mx0]);
  ans.push(mrg);
  ch.erase(ch.begin() + mx0);
  for (auto& q: ch) for (auto x: getc(q)) ans.push(x);
  return ans;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  for (int i = 1; i < n; ++i) { int p; cin >> p; nei[--p].push_back(i); }
  int ans = 0;
  auto v = getc(solve(0)); sort(v.rbegin(), v.rend());
  for (auto x: v) {
    cout << ++ans << ' ';
    while (x--) cout << (ans += 2) << ' ';
  }
}