#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
  fast_ios() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  for (long long i = 0; i < v.size(); i++) {
    cout << v[i];
    if (i != v.size() - 1) cout << endl;
  };
  return os;
}
template <typename T>
void Out(T x) {
  cout << x << endl;
}
template <typename T1, typename T2>
void Ans(bool first, T1 y, T2 n) {
  if (first)
    Out(y);
  else
    Out(n);
}
using vec = vector<long long>;
using mat = vector<vec>;
using Pii = pair<long long, long long>;
using PiP = pair<long long, Pii>;
using PPi = pair<Pii, long long>;
using bools = vector<bool>;
using pairs = vector<Pii>;
const long long mod = 1000000007;
struct edge {
  long long to, cost, id;
};
class Graph {
 public:
  long long N;
  vector<vector<edge>> G;
  vec depth;
  vec par;
  vec ans, vs;
  Graph(long long N) : N(N) {
    G = vector<vector<edge>>(N, vector<edge>(0));
    depth.resize(N);
    par.resize(N);
  }
  void add_Directed_edge(long long from, long long to, long long cost = 1,
                         long long id = 0) {
    G[from].push_back(edge({to, cost, id}));
  }
  void add_Undirected_edge(long long v1, long long v2, long long cost = 1,
                           long long id = 0) {
    add_Directed_edge(v1, v2, cost, id);
    add_Directed_edge(v2, v1, cost, id);
  }
  void dfs_for_depth(long long v = 0, long long p = -1) {
    depth[v] = 0;
    par[v] = p;
    for (auto e : G[v]) {
      dfs_for_depth(e.to, v);
      depth[v] = max(depth[v], depth[e.to] + 1);
    }
  }
  void dfs(long long v = 0, long long prev = -1) {
    pairs p;
    for (auto e : G[v]) p.push_back(Pii(depth[e.to], e.to));
    sort(p.begin(), p.end());
    reverse(p.begin(), p.end());
    for (auto e : p) {
      if (prev != -1) ans.push_back(prev);
      dfs(e.second, prev);
      prev = e.second;
    }
    vs.push_back(v);
    if (v == 0) {
      reverse(vs.begin(), vs.end());
      reverse(ans.begin(), ans.end());
    }
  }
};
signed main() {
  long long n;
  cin >> n;
  Graph G(n);
  for (long long i = (1); i < (n); i++) {
    long long p;
    cin >> p;
    G.add_Directed_edge(p, i);
  }
  G.dfs_for_depth();
  G.dfs();
  for (long long i = (0); i < (n); i++) cout << G.vs[i] << ' ';
  cout << endl;
  Out(((long long)G.ans.size()));
  for (long long i = (0); i < (((long long)G.ans.size())); i++)
    cout << G.ans[i] << ' ';
  cout << endl;
  return 0;
}
