#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
clock_t time_p = clock();
void aryanc403() {}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || (a.first == b.first && a.second <= b.second));
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
const long long int maxN = 100000L;
long long int T, n, i, j, k, in, cnt, l, r, u, v, x, y;
long long int m;
string s;
vector<long long int> e[maxN + 5], a;
long long int sze[maxN + 5], p[maxN + 5], rt;
void link(long long int x, long long int y) {
  a.push_back(x);
  p[x] = y;
}
void dfs(long long int u, long long int y) {
  if (e[u].empty()) {
    if (y == -1) rt = u;
    return;
  }
  if (y != -1) link(y, e[u][0]);
  dfs(e[u][0], y);
  long long int n = (int)(e[u]).size(), i;
  for (i = (1); i <= (n - 1); ++i) {
    link(e[u][i - 1], e[u][i]);
    dfs(e[u][i], e[u][i - 1]);
  }
}
long long int dfs_(long long int u) {
  long long int &c = sze[u];
  c = 0;
  for (auto x : e[u]) c = max(c, dfs_(x));
  c++;
  sort(e[u].begin(), e[u].end(),
       [&](const long long int &a, const long long int &b) {
         return sze[a] > sze[b];
       });
  return c;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    cin >> n;
    for (i = (1); i <= (n - 1); ++i) {
      cin >> in;
      e[in].push_back(i);
      p[i] = in;
    }
    dfs_(0);
    dfs(0, -1);
    vector<long long int> b;
    u = rt;
    while (n--) {
      b.push_back(u);
      u = p[u];
    }
    reverse(begin(b), end(b));
    for (auto x : b) cout << x << " ";
    cout << "\n";
    reverse(begin(a), end(a));
    cout << (int)(a).size() << "\n";
    for (auto x : a) cout << x << " ";
  }
  aryanc403();
  return 0;
}
