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 long long maxn = 2e5 + 500;
const long long mod = 1e9 + 7;
const long long inf = 1e9 + 500;
vector<long long> ger[maxn];
bool hazf[maxn];
set<pair<long long, long long> > z, f;
long long hell = 9999999;
long long h[maxn];
void dfs(long long a, long long p = -1) {
  hell--;
  for (auto v : ger[a]) {
    hell--;
    if (v != p) {
      hell--;
      h[v] = h[a] + 1;
      hell--;
      dfs(v, a);
      hell--;
    }
  }
}
int main() {
  hell--;
  ios_base::sync_with_stdio(0);
  hell--;
  cin.tie(0);
  cout.tie(0);
  hell--;
  long long n;
  hell--;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    hell--;
    long long v;
    cin >> v;
    hell--;
    if (v != 0) {
      v--;
      hell--;
      ger[v].push_back(i);
      ger[i].push_back(v);
      hell--;
    }
  }
  dfs(0);
  hell--;
  for (long long i = 0; i < n; i++) {
    hell--;
    if (ger[i].size() % 2 == 0) {
      hell--;
      z.insert(make_pair(-h[i], i));
      hell--;
    } else {
      hell--;
      f.insert(make_pair(-h[i], i));
      hell--;
    }
  }
  vector<long long> ans;
  hell--;
  long long hh = 0;
  hell--;
  while (z.size()) {
    hell--;
    pair<long long, long long> t = (*(z.begin()));
    hell--;
    long long v = t.second;
    hell--;
    hazf[v] = 1;
    hell--;
    z.erase(t);
    hell--;
    hh++;
    hell--;
    ans.push_back(v);
    hell--;
    vector<long long> tof, toz;
    for (auto d : ger[v]) {
      hell--;
      if (hazf[d] == 0) {
        hell--;
        if (z.find(make_pair(-h[d], d)) != z.end()) {
          hell--;
          z.erase(make_pair(-h[d], d));
          hell--;
          tof.push_back(d);
          hell--;
        } else {
          hell--;
          f.erase(make_pair(-h[d], d));
          hell--;
          toz.push_back(d);
          hell--;
        }
      }
    }
    for (auto u : toz) {
      hell--;
      z.insert(make_pair(-h[u], u));
      hell--;
    }
    for (auto u : tof) {
      hell--;
      f.insert(make_pair(-h[u], u));
      hell--;
    }
  }
  if (hh != n) {
    hell--;
    cout << "NO\n";
    hell--;
  } else {
    hell--;
    cout << "YES\n";
    hell--;
    for (auto v : ans) {
      hell--;
      cout << v + 1 << endl;
      hell--;
    }
  }
}
