#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
vector<int> adj[200001];
int dist[200001];
int prevv[200001];
int n;
void bfs(int x);
vector<int> getPath(int from, int to);
int main() {
  cin >> n;
  for (int i = 2; i <= n; i++) {
    int sk;
    cin >> sk;
    adj[i].push_back(sk);
    adj[sk].push_back(i);
  }
  bfs(1);
  return 0;
}
void bfs(int x) {
  for (int i = 1; i <= n; i++) {
    prevv[i] = -1;
    dist[i] = INF;
  }
  queue<int> q;
  dist[x] = 0;
  q.push(x);
  while (!q.empty()) {
    int s = q.front();
    q.pop();
    for (int u : adj[s]) {
      if (dist[u] == INF) {
        dist[u] = dist[s] + 1;
        prevv[u] = s;
        q.push(u);
      }
    }
  }
  vector<int> path = getPath(1, n);
  for (int i : path) cout << i << " ";
}
vector<int> getPath(int from, int to) {
  vector<int> path;
  int curr = to;
  while (curr != -1) {
    path.push_back(curr);
    curr = prevv[curr];
  }
  sort(path.begin(), path.end());
  return path;
}
