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 = 2e5 + 20;
int n;
struct edge {
  int y, nxt;
} e[N << 1];
int lin[N], len = 1;
int cnt[N], ans[N], pos;
bool mark[N];
inline int read() {
  int s = 0, f = 1;
  char ch;
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') f = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    s = (s << 1) + (s << 3) + ch - '0';
  return s * f;
}
inline void add(int xx, int yy) {
  e[++len] = (edge){yy, lin[xx]};
  lin[xx] = len;
}
inline void dfs(int x, int fa, bool flag) {
  if (!flag) {
    for (int i = lin[x]; i; i = e[i].nxt) {
      int y = e[i].y;
      if (y == fa) continue;
      if (!mark[y]) dfs(y, x, 0);
    }
  }
  if (!(cnt[x] % 2)) {
    cnt[x] = 0;
    ans[++pos] = x;
    mark[x] = 1;
    for (int i = lin[x]; i; i = e[i].nxt) {
      int y = e[i].y;
      --cnt[y];
      if (y == fa) continue;
      if (!mark[y]) dfs(y, x, 1);
    }
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    int x = read();
    if (x) {
      add(i, x);
      add(x, i);
      cnt[i]++;
      cnt[x]++;
    }
  }
  dfs(1, 0, 0);
  if (pos == n) {
    puts("YES");
    for (int i = 1; i <= n; ++i) printf("%d\n", ans[i]);
  } else
    puts("NO");
  return 0;
}
