Problem: Bytelandian Tree Factory produces trees for all kinds of industrial applications. You have been tasked with optimizing the production of a certain type of tree for an especially large and important order.

The tree in question is a rooted tree with n vertices labelled with distinct integers from 0 to n - 1. The vertex labelled 0 is the root of the tree, and for any non-root vertex v the label of its parent p(v) is less than the label of v.

All trees at the factory are made from bamboo blanks. A bamboo is a rooted tree such that each vertex has exactly one child, except for a single leaf vertex with no children. The vertices of a bamboo blank can be labelled arbitrarily before its processing is started.

To process a bamboo into another tree a single type of operation can be made: choose an arbitrary non-root vertex v such that its parent p(v) is not a root either. The operation consists of changing the parent of v to its parent's parent p(p(v)). Note that parents of all other vertices remain unchanged, in particular, the subtree of v does not change.

Efficiency is crucial, hence you have to minimize the number of operations to make the desired tree from a bamboo blank. Construct any optimal sequence of operations to produce the desired tree.

Note that the labelling of the resulting tree has to coincide with the labelling of the desired tree. Formally, the labels of the roots have to be equal, and for non-root vertices with the same label the labels of their parents should be the same.

It is guaranteed that for any test present in this problem an answer exists, and further, an optimal sequence contains at most 10^6 operations. Note that any hack that does not meet these conditions will be invalid.

Input

The first line contains a single integer n — the number of vertices in the tree (2 ≤ n ≤ 10^5).

The second line contains n - 1 integers p(1), …, p(n - 1) — indices of parent vertices of 1, …, n - 1 respectively (0 ≤ p(i) < i).

Output

In the first line, print n distinct integers id_1, …, id_n — the initial labelling of the bamboo blank starting from the root vertex (0 ≤ id_i < n).

In the second line, print a single integer k — the number of operations in your sequence (0 ≤ k ≤ 10^6).

In the third line print k integers v_1, …, v_k describing operations in order. The i-th operation consists of changing p(v_i) to p(p(v_i)). Each operation should be valid, i.e. neither v_i nor p(v_i) can be the root of the tree at the moment.

Examples

Input


5
0 0 1 1


Output


0 2 1 4 3
2
1 3


Input


4
0 1 2


Output


0 1 2 3
0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int f = 1, x = 0;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -1;
  } while (ch < '0' || ch > '9');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return f * x;
}
const int N = 1e5;
int n;
int fa[N + 1];
struct Edge {
  int to, next;
} edge[(N << 1) + 1];
int start[N + 1], tot;
int dep[N + 1], which[N + 1];
int sons[N + 1], tag[N + 1];
vector<int> opt, ans;
inline void addedge(int u, int v) {
  edge[++tot] = Edge{v, start[u]};
  start[u] = tot;
  sons[u]++;
  return;
}
inline void dfs1(int u) {
  for (int i = start[u]; i; i = edge[i].next) {
    int v = edge[i].to;
    dfs1(v);
    dep[u] = max(dep[u], dep[v] + 1);
  }
  return;
}
inline void dfs2(int u) {
  bool flag = true;
  tag[u] = 1;
  for (int i = start[u]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (dep[u] == dep[v] + 1 && flag) {
      which[u] = v;
      dfs2(v);
      flag = false;
    }
  }
  if (sons[u] > 1) opt.push_back(u);
  return;
}
inline void dfs3(int u) {
  printf("%d ", u);
  for (int i = start[u]; i; i = edge[i].next) {
    int v = edge[i].to;
    if (fa[v] == u) dfs3(v);
  }
  return;
}
int main() {
  n = read();
  for (int i = 1; i < n; i++) {
    fa[i] = read();
    addedge(fa[i], i);
  }
  dfs1(0);
  dfs2(0);
  for (int i = 0; i < opt.size(); i++) {
    int u = opt[i];
    for (int j = start[u]; j; j = edge[j].next) {
      int v = edge[j].to;
      if (tag[v]) continue;
      if (fa[v] != u) continue;
      fa[which[u]] = v;
      addedge(v, which[u]);
      ans.push_back(which[u]);
      which[v] = which[u];
      which[u] = v;
      tag[v] = 1;
      if (sons[v] > 1) opt.push_back(v);
    }
  }
  dfs3(0);
  printf("\n");
  printf("%d\n", ans.size());
  for (int i = ans.size() - 1; i >= 0; i--) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}