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 = 200002;
int n;
struct edge {
  int to, nxt;
} tree[N << 1];
int head[N], cnt = 0;
void addEdge(int u, int v) {
  edge node = {v, head[u]};
  tree[head[u] = ++cnt] = node;
}
int num[N], deg[N];
vector<int> graph[N];
void dfs(int u, int v) {
  num[u] = 0;
  for (int i = head[u]; i; i = tree[i].nxt)
    if (tree[i].to != v) {
      dfs(tree[i].to, u), num[u] ^= (num[tree[i].to] ^ 1);
      if (num[tree[i].to])
        graph[tree[i].to].push_back(u);
      else
        graph[u].push_back(tree[i].to);
    }
}
queue<int> q;
vector<int> seq;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int pi;
    scanf("%d", &pi);
    if (!pi) continue;
    addEdge(pi, i), addEdge(i, pi);
  }
  if (n % 2 == 0)
    printf("NO\n");
  else {
    printf("YES\n");
    dfs(1, 0);
    for (int i = 1; i <= n; i++) deg[i] = 0;
    for (int i = 1; i <= n; i++)
      for (int j = 0; j < graph[i].size(); j++) deg[graph[i][j]]++;
    for (int i = 1; i <= n; i++)
      if (!deg[i]) q.push(i);
    while (!q.empty()) {
      int u = q.front();
      q.pop(), seq.push_back(u);
      for (int i = 0; i < graph[u].size(); i++) {
        deg[graph[u][i]]--;
        if (!deg[graph[u][i]]) q.push(graph[u][i]);
      }
    }
    for (int i = 1; i <= n; i++) printf("%d\n", seq[i - 1]);
  }
  return 0;
}
