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;
const int N = 200010;
int ne[N << 1], fi[N], b[N << 1], d[N], n, k, rt;
vector<int> s[N], ans;
void add(int x, int y) {
  ne[++k] = fi[x];
  b[fi[x] = k] = y;
  ++d[x];
}
void era(int x) {
  for (vector<int>::iterator i = s[x].begin(); i != s[x].end(); ++i)
    if (*i == x)
      ans.push_back(x);
    else
      era(*i);
  s[x].clear();
}
void fst(int x, int fa) {
  s[x].push_back(x);
  for (int j = fi[x]; j; j = ne[j])
    if (b[j] != fa) {
      fst(b[j], x);
      if (s[b[j]].size()) s[x].push_back(b[j]);
    }
  if (~d[x] & 1) {
    --d[fa];
    era(x);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    if (x == 0)
      rt = i;
    else
      add(x, i), add(i, x);
  }
  fst(rt, 0);
  if ((signed)ans.size() != n) return puts("NO"), 0;
  puts("YES");
  for (vector<int>::iterator i = ans.begin(); i != ans.end(); ++i)
    printf("%d\n", *i);
}
