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>
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Collection;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.Queue;
import java.io.BufferedReader;
import java.util.ArrayDeque;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        List<Integer>[] tree;
        int[] size;
        int[] up;
        int[] parent;

        void dfs(int u, int p) {
            size[u] = 1;
            parent[u] = p;
            for (int t = 0; t < tree[u].size(); t++) {
                int v = tree[u].get(t);
                if (v != p) {
                    dfs(v, u);
                    size[u] ^= size[v];
                }
            }
            up[u] = size[u] ^ 1;
        }

        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            size = new int[n];
            parent = new int[n];
            up = new int[n];
            tree = new List[n];
            for (int i = 0; i < n; i++) {
                tree[i] = new ArrayList<>();
            }
            if (n % 2 == 0) {
                out.println("NO");
                return;
            }
            for (int i = 0; i < n; i++) {
                int p = in.nextInt();
                if (p != 0) {
                    tree[i].add(p - 1);
                    tree[p - 1].add(i);
                }
            }
            dfs(0, -1);
            Queue<Integer> q = new ArrayDeque<>();
            List<Integer> ans = new ArrayList<>();
            int[] remDeg = new int[n];
            int[] countOdd = new int[n];
            for (int i = 0; i < n; i++) {
                remDeg[i] = tree[i].size();
                for (int j : tree[i]) {
                    if (j != parent[i]) {
                        countOdd[i] += size[j];
                    } else {
                        countOdd[i] += up[i];
                    }
                }
                if (remDeg[i] % 2 == 0 && countOdd[i] == remDeg[i]) {
                    q.add(i);
                }
            }
            boolean[] used = new boolean[n];
            while (!q.isEmpty()) {
                int cur = q.poll();
                used[cur] = true;
                ans.add(cur);
                for (int i : tree[cur]) {
                    if (used[i]) {
                        continue;
                    }
                    remDeg[i]--;
                    if (parent[i] == cur) {
                        countOdd[i] -= (size[i] ^ 1);
                    } else {
                        countOdd[i] -= size[cur];
                    }
                    if (remDeg[i] % 2 == 0 && countOdd[i] == remDeg[i]) {
                        q.add(i);
                    }
                }
            }
            if (ans.size() != n) {
                out.println("NO");
            } else {
                out.println("YES");
                for (int i : ans) {
                    out.println(i + 1);
                }
            }
        }

    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                String line = null;
                try {
                    line = br.readLine();
                } catch (IOException e) {
                }
                st = new StringTokenizer(line);
            }
            return st.nextToken();
        }

    }
}

