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;
inline int Read() {
  char c = getchar();
  int num = 0;
  while ('0' > c || c > '9') c = getchar();
  while ('0' <= c && c <= '9') num = num * 10 + c - '0', c = getchar();
  return (num);
}
vector<int> e[400010];
vector<pair<int, int> > s[400010][2];
int f[400010][2], d[400010], n, m;
inline void Dp(int x, int y) {
  for (int i = 0; i < e[x].size(); i++)
    s[x][1].push_back(make_pair(-1, -1)), s[x][0].push_back(make_pair(-1, -1));
  if (d[x] == 1 && y) {
    f[x][0] = 1;
    return;
  }
  int g0 = -1, g1 = -1;
  for (int i = 0; i < e[x].size(); i++)
    if (e[x][i] != y) {
      Dp(e[x][i], x);
      if (g0 == -1) {
        if (f[e[x][i]][0]) g0 = 1, s[x][0][i] = make_pair(0, 0);
        if (f[e[x][i]][1]) g1 = 1, s[x][1][i] = make_pair(1, 1);
        if (g0 == -1) g0 = 0;
        if (g1 == -1) g1 = 0;
        continue;
      }
      int g0_ = g0, g1_ = g1;
      g0 = g1 = 0;
      if (g0_ && f[e[x][i]][1]) g1 = 1, s[x][1][i] = make_pair(0, 1);
      if (g1_ && f[e[x][i]][0]) g1 = 1, s[x][1][i] = make_pair(1, 0);
      if (g1_ && f[e[x][i]][1]) g0 = 1, s[x][0][i] = make_pair(1, 1);
      if (g0_ && f[e[x][i]][0]) g0 = 1, s[x][0][i] = make_pair(0, 0);
    }
  if (x == 1) {
    if (d[x] % 2 == 0)
      f[x][0] = g0;
    else
      f[x][0] = g1;
  } else {
    if (d[x] % 2 == 0)
      f[x][0] = g1, f[x][1] = g0;
    else
      f[x][0] = g0, f[x][1] = g1;
  }
}
inline void Write(int x, int y, int w) {
  if (x == 1) {
    if (d[x] % 2 == 1) w ^= 1;
  } else {
    if (d[x] % 2 == 0) w ^= 1;
  }
  int w0 = w;
  for (int i = e[x].size() - 1; i >= 0; i--)
    if (e[x][i] != y) {
      if (s[x][w][i].second == 1) Write(e[x][i], x, s[x][w][i].second);
      w = s[x][w][i].first;
    }
  printf("%d\n", x);
  if (x == 4) int deb = 0;
  w = w0;
  for (int i = e[x].size() - 1; i >= 0; i--)
    if (e[x][i] != y) {
      if (s[x][w][i].second == 0) Write(e[x][i], x, s[x][w][i].second);
      w = s[x][w][i].first;
    }
}
int p[400010];
int main() {
  n = Read();
  for (int i = 1; i <= n; i++) {
    p[i] = Read();
    if (p[i]) {
      e[i].push_back(p[i]), e[p[i]].push_back(i);
      d[p[i]]++, d[i]++;
    }
  }
  Dp(1, 0);
  if (!f[1][0]) {
    puts("NO");
    return (0);
  }
  puts("YES");
  Write(1, 0, 0);
}
