You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any vertex from any other vertex using only its edges).

A vertex can be destroyed if this vertex has even degree. If you destroy a vertex, all edges connected to it are also deleted.

Destroy all vertices in the given tree or determine that it is impossible.

Input

The first line contains integer n (1 ≤ n ≤ 2·105) — number of vertices in a tree.

The second line contains n integers p1, p2, ..., pn (0 ≤ pi ≤ n). If pi ≠ 0 there is an edge between vertices i and pi. It is guaranteed that the given graph is a tree.

Output

If it's possible to destroy all vertices, print "YES" (without quotes), otherwise print "NO" (without quotes).

If it's possible to destroy all vertices, in the next n lines print the indices of the vertices in order you destroy them. If there are multiple correct answers, print any.

Examples

Input

5
0 1 2 1 2


Output

YES
1
2
3
5
4


Input

4
0 1 2 3


Output

NO

Note

In the first example at first you have to remove the vertex with index 1 (after that, the edges (1, 2) and (1, 4) are removed), then the vertex with index 2 (and edges (2, 3) and (2, 5) are removed). After that there are no edges in the tree, so you can remove remaining vertices in any order.

<image>
#include <bits/stdc++.h>
using namespace std;
class Tree {
  int n;

 public:
  int *deg, *p;
  bool *EvenDeg, *erased;
  vector<int> *adj;
  Tree(int n);
  void AddEdge(int u, int v);
  void compEvenDeg(int x);
  void Dfs(int x);
};
int root;
Tree::Tree(int n) {
  this->n = n;
  deg = new int[n];
  p = new int[n];
  EvenDeg = new bool[n];
  erased = new bool[n];
  adj = new vector<int>[n];
  for (int i = 0; i < n; ++i) erased[i] = deg[i] = EvenDeg[i] = 0;
}
void Tree::AddEdge(int u, int v) {
  adj[u].push_back(v);
  ++deg[u];
  ++deg[v];
  p[v] = u;
}
void Tree::compEvenDeg(int u) {
  EvenDeg[u] = false;
  for (int v : adj[u]) {
    compEvenDeg(v);
    EvenDeg[u] |= (EvenDeg[v] | !(deg[v] % 2));
  }
}
void Tree::Dfs(int u) {
  bool ok = false;
  if ((deg[u] % 2 == 0) && !EvenDeg[u]) {
    erased[u] = true;
    ok = true;
    printf("%d\n", u + 1);
    if (u != root) --deg[p[u]];
  }
  for (int v : adj[u]) {
    if (erased[u]) --deg[v];
    if (!erased[v] && ((deg[v] % 2 == 0) || EvenDeg[v])) Dfs(v);
  }
  if (!erased[u] && (deg[u] % 2 == 0)) {
    erased[u] = true;
    printf("%d\n", u + 1);
    if (u != root) --deg[p[u]];
  }
  for (int v : adj[u]) {
    if (erased[u] && !ok) --deg[v];
    if (!erased[v]) Dfs(v);
  }
}
int deg[200002];
int main() {
  int n;
  scanf("%d", &n);
  if (n % 2) {
    printf("YES\n");
    Tree T(n);
    for (int u = 0, v; u < n; ++u) {
      scanf("%d", &v);
      --v;
      if (v == -1)
        root = u;
      else
        T.AddEdge(v, u);
    }
    T.compEvenDeg(root);
    T.Dfs(root);
  } else
    printf("NO\n");
  return 0;
}
