#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int mxN = 1e5 + 1, MIN = -1e9, MAX = 1e9;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
void out(long long int n) {
  cout << n << endl;
  return;
}
void outs(string str) {
  cout << str << endl;
  return;
}
void init() {}
void solve(int case_no) {
  int n;
  cin >> n;
  int a[n + 1];
  a[1] = 0;
  for (int i = 2; i <= n; i++) cin >> a[i];
  int ptr = n;
  stack<int> s;
  while (ptr != 0) {
    s.push(ptr);
    ptr = a[ptr];
  }
  while (!s.empty()) {
    cout << s.top() << ' ';
    s.pop();
  }
  cout << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
}
