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 mod = 1000000007;
const int N = 212345;
int par[N];
vector<int> g[N];
int num[N], adj[N], ct, vis[N];
void dfs(int u) {
  num[u] = ct++;
  for (auto v : g[u]) dfs(v);
}
int main(void) {
  int n;
  scanf("%d", &n);
  int root = -1;
  for (int i = 1; i <= n; i++) {
    int p;
    scanf("%d", &p);
    g[p].push_back(i);
    par[i] = p;
    if (!p)
      root = i;
    else {
      adj[i]++;
      adj[p]++;
    }
  }
  dfs(root);
  set<pair<int, int> > s;
  for (int i = 1; i <= n; i++) {
    if (par[i]) g[i].push_back(par[i]);
    if (adj[i] % 2 == 0) {
      s.emplace(-num[i], i);
    }
  }
  vector<int> ans;
  while (!s.empty()) {
    int u = s.begin()->second;
    s.erase(s.begin());
    vis[u] = 1;
    for (auto v : g[u]) {
      if (vis[v]) continue;
      if (adj[v] % 2) {
        s.emplace(-num[v], v);
      } else {
        s.erase(make_pair(-num[v], v));
      }
      adj[v]--;
    }
    ans.push_back(u);
  }
  if (ans.size() == n) {
    printf("YES\n");
    for (int i = 0; i < n; i++) printf("%d\n", ans[i]);
  } else
    printf("NO\n");
  return 0;
}
