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 maxn = 200010;
vector<int> ve[maxn], ans;
int deep[maxn], cnt[maxn];
int n;
struct node {
  int u, dep;
  friend bool operator<(const node &a, const node &b) { return a.dep < b.dep; }
};
priority_queue<node> q;
void dfs(int u, int fa) {
  deep[u] = deep[fa] + 1;
  if (cnt[u] % 2 == 0) {
    q.push({u, deep[u]});
  }
  for (int i = 0; i < cnt[u]; i++) {
    if (ve[u][i] != fa) dfs(ve[u][i], u);
  }
}
bool vis[maxn];
void init() {
  for (int i = 1; i <= n; i++) {
    ve[i].clear();
  }
  memset(cnt, 0, sizeof(cnt));
  ans.clear();
}
int main() {
  while (cin >> n) {
    int x, rt;
    init();
    for (int i = 1; i <= n; i++) {
      scanf("%d", &x);
      if (x) {
        ve[x].push_back(i);
        ve[i].push_back(x);
        cnt[x]++, cnt[i]++;
      } else {
        rt = i;
      }
    }
    if (n % 2 == 0) {
      puts("NO");
      continue;
    }
    dfs(rt, 0);
    x = 0;
    while (!q.empty()) {
      node s = q.top();
      q.pop();
      if (cnt[s.u] % 2 == 1 || vis[s.u] == 1) continue;
      ans.push_back(s.u);
      vis[s.u] = 1;
      x++;
      int si = ve[s.u].size();
      for (int i = 0; i < si; i++) {
        int y = ve[s.u][i];
        if (!vis[y])
          if ((--cnt[y]) % 2 == 0) {
            q.push({y, deep[y]});
          }
      }
    }
    if (x < n)
      puts("NO");
    else {
      puts("YES");
      for (int i = 0; i < n; i++) {
        printf("%d\n", ans[i]);
      }
    }
  }
}
