#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 47;
vector<vector<long long> > graf(MAXN);
long long n;
vector<long long> need, bamb, pr;
void read() {
  cin >> n;
  need.resize(n);
  for (long long i = 0; i < n - 1; i++) {
    cin >> need[i + 1];
    graf[i + 1].push_back(need[i + 1]);
    graf[need[i + 1]].push_back(i + 1);
  }
}
long long H = 1, ind = 0;
void dfs1(long long p1, long long pr, long long h) {
  if (h > H) {
    H = h;
    ind = p1;
  }
  for (long long p2 : graf[p1]) {
    if (p2 == pr) continue;
    dfs1(p2, p1, h + 1);
  }
}
vector<long long> lst, temp;
long long UK = 1, fnd = 0;
void dfs2(long long p1, long long pr) {
  temp.push_back(p1);
  if (p1 == ind) {
    lst = temp;
    fnd = 1;
    return;
  }
  for (long long p2 : graf[p1]) {
    if (p2 == pr) continue;
    dfs2(p2, p1);
    if (fnd == 1) return;
  }
  temp.pop_back();
}
void dfs3(long long p1, long long pr) {
  bamb.push_back(p1);
  long long hav = 0;
  for (long long p2 : graf[p1]) {
    if (p2 == pr) continue;
    if (UK != (long long)(lst.size()) && p2 == lst[UK]) {
      hav = 1;
      continue;
    }
    dfs3(p2, p1);
  }
  if (hav == 1) {
    UK++;
    dfs3(lst[UK - 1], p1);
  }
}
void solve() {
  dfs1(0, -1, 0);
  dfs2(0, -1);
  dfs3(0, -1);
  for (long long p : bamb) cout << p << " ";
  cout << endl;
  pr.resize(n);
  for (long long i = 1; i < n; i++) pr[bamb[i]] = bamb[i - 1];
  vector<long long> ans;
  for (long long p : bamb) {
    while (pr[p] != need[p]) {
      pr[p] = pr[pr[p]];
      ans.push_back(p);
    }
  }
  cout << (long long)(ans.size()) << endl;
  for (long long p : ans) cout << p << " ";
  cout << endl;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long t = 1;
  while (t--) {
    read();
    solve();
  }
}
