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;
int n;
unordered_set<int> g[200005];
bool gone[200005];
void dfs1(int u, int p) {
  printf("%d\n", u);
  gone[u] = true;
  for (auto v : g[u]) {
    if (v == p) continue;
    dfs1(v, u);
  }
}
void dfs(int u, int p) {
  if (gone[u]) return;
  for (auto itr = g[u].begin(); itr != g[u].end();) {
    int v = *itr;
    auto nitr = next(itr);
    if (v == p) {
      itr = nitr;
      continue;
    }
    dfs(v, u);
    itr = nitr;
  }
  if (g[u].size() && (g[u].size() & 1) == 0) {
    printf("%d\n", u);
    gone[u] = true;
    for (auto itr = g[u].begin(); itr != g[u].end();) {
      int v = *itr;
      auto nitr = next(itr);
      g[u].erase(v);
      g[v].erase(u);
      if (v != p) {
        dfs1(v, u);
      }
      itr = nitr;
    }
  }
}
int main() {
  memset(gone, 0, sizeof(gone));
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int u = i;
    int v;
    scanf("%d", &v);
    if (v == 0) continue;
    g[u].insert(v);
    g[v].insert(u);
  }
  if ((n & 1) == 0) {
    printf("NO\n");
    return (0);
  }
  printf("YES\n");
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    if (gone[i] == false) printf("%d\n", i);
  }
  return (0);
}
