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

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup
{
  IOSetup()
  {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a)
{
  for (auto x : a)
    cerr << x << ' ';
  cout << endl;
}

void print(auto x) { cout << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail)
{
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

int main()
{
  int n;
  cin >> n;
  vector<int> par(n, -1);
  vvi child(n);
  rep2(v, 1, n)
  {
    cin >> par[v];
    par[v]--;
    child[par[v]].push_back(v);
  }
  vi S(n), leaf(n, 0), dp(n, 0);
  vector<vector<pair<int, int>>> szs(n);
  auto dfs = [&](auto dfs, int v) -> int
  {
    if (child[v].size() == 0)
    {
      leaf[v] = 1;
      dp[v]=0;
      return 0;
    }
    for (auto u : child[v])
    {
      szs[v].push_back({dfs(dfs, u), u});
    }
    sort(szs[v].rbegin(), szs[v].rend());
    if (szs[v].size() == 1)
    {
      dp[v] = szs[v][0].first;
    }
    else
    {
      dp[v] = szs[v][0].first + szs[v][1].first + 1;
    }
    return dp[v];
  };
  dfs(dfs, 0);
  int m = 0;
  rep(i, n) m += leaf[i];
  if (m == 1)
  {
    cout << 1 << endl;
    exit(0);
  }
  priority_queue<pair<int, int>> pq;
  vi ans = {};
  vi todo = {0};
  while (todo.size() > 0 || pq.size() > 0)
  {
    int v;
    if (todo.size() > 0)
    {
      v = todo.back();
      todo.pop_back();
    }
    else
    {
      v = pq.top().second;
      pq.pop();
      ans.push_back(0);
    }
    bool flg = true;
    while (true)
    {
      if (leaf[v])
      {
        flg = false;
        break;
      }
      if (child[v].size() == 1)
      {
        v = child[v][0];
      }
      else
      {
        break;
      }
    }
    if (!flg)
      continue;
    if (szs[v].size()){
      ans.push_back(1);
    }
    // else
    //   ans.push_back(0);
    rep(i, szs[v].size())
    {
      auto [sz, u] = szs[v][i];
      if (i < 2)
        todo.push_back(u);
      else
        pq.push({sz, u});
    }
  }
  int tmp = 1;
  cout << 1 << " ";
  rep2(i, 1, m)
  {
    if (i - 1 < ans.size())
      tmp += 1 + ans[i - 1];
    else
      tmp++;
    cout << tmp << " ";
  }
  cout << endl;
}