#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], ans, cnt = 0;
vector <int> e[N];
void dfs(int u) {
   int mx1 = 0, mx2 = 0;
   for(auto v : e[u]) {
      dfs(v);
      if(f[v] >= f[mx1]) mx2 = mx1, mx1 = v;
      else if(f[v] >= f[mx2]) mx2 = v;
   } int x = e[u].size();
   // f[u] = max(f[u], f[mx1] + f[mx2] + (mx1 > 0 && mx2 > 0));
   if(x > 1) ++ans;// = max(ans, f[u]);
   if(u > 1 && !x) ++cnt;
}
int main() {
   cin >> n;
   rep1(i, 2, n) {
      int x; cin >> x;
      e[x].pb(i);
   } dfs(1);
   int nw = 1;
   // cout << cnt << '\n';
   rep1(i, 1, cnt) {
      cout << nw << ' ';
      ++nw; if(ans) ++nw, --ans;
   }
   return 0;
}