#include<bits/stdc++.h>
#define rep1(i, a, b) for(int i = a; i <= b; ++i)
#define rep2(i, a, b) for(int i = a; i >= b; --i)
#define ll long long
#define ft first
#define sd second
#define pb push_back
#define pii pair <int, int> 
#define ptc putchar
#define ld long double
#define debug puts("-------------------")
const int N = 2e5 + 10;
using namespace std;
int n, f[N], num[N], tot, cnt, ans[N];
vector <int> e[N];
void dfs(int u) {
   int mx1 = 0, mx2 = 0;
   for(auto v : e[u]) {
      dfs(v); f[u] += f[v];
      if(f[v] >= f[mx1]) mx2 = mx1, mx1 = v;
      else if(f[v] >= f[mx2]) mx2 = v;
   } int x = e[u].size();
   if(mx1 && mx2) f[u] = f[mx1] + f[mx2];//, cout << u << ' ' << f[u] << '\n';
   for(auto v : e[u]) if(v != mx1 && v != mx2) num[++tot] = f[v];
   f[u] += x > 1; if(u > 1 && !x) ++cnt;
   // cout << u << ' ' << f[u] << '\n';
}
int main() {
   cin >> n;
   rep1(i, 2, n) {
      int x; cin >> x;
      e[x].pb(i);
   } dfs(1); num[++tot] = f[1];
   sort(num + 1, num + tot + 1);
   int nw = 1, id = tot;
   // rep1(i, 1, tot) cout << num[i] << ' '; puts("");
   rep1(i, 1, cnt) {
      cout << nw << ' '; ++nw;
      if(id) {
         if(num[id]) ++nw, --num[id];
         else --id;
      }
   }
   return 0;
}