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