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.util.*;
import java.util.stream.*;
import java.io.*;

public class Solution {
    public static void main(String[] args) throws Exception {
        int n;
        StringTokenizer tokenizer;
        try (BufferedReader in = new BufferedReader(new InputStreamReader(System.in))) {
            n = Integer.parseInt(in.readLine());
            tokenizer = new StringTokenizer(in.readLine());
        }
        List<Integer>[] tree = new List[n];
        for (int i = 0; i < n; ++i) {
            tree[i] = new ArrayList<Integer>();
        }
        int[] parent = new int[n];
        int[] degree = new int[n];
        int root = -1;
        for (int i = 0; i < n; ++i) {
            int p = Integer.parseInt(tokenizer.nextToken()) - 1;
            if (p == -1) {
                root = i;
                continue;
            }
            parent[i] = p;
            degree[p]++;
            degree[i]++;
            tree[i].add(p);
            tree[p].add(i);
        }
        Solution solver = new Solution();
        System.out.println(solver.solve(tree, root, parent, degree));
    }
    
    public String solve(List<Integer>[] tree, int root, int[] parent, int[] degree) {
        if (tree.length % 2 == 0) {
            return "NO";
        }
        List<Integer> order = new ArrayList<>(tree.length);
        topSort(root, -1, tree, order);
        List<Integer> removeOrder = new ArrayList<>(tree.length);
        List<Integer> rest = new ArrayList<>();
        for (int v : order) {
            if (degree[v] % 2 == 0) {
                removeOrder.add(v + 1);
                degree[parent[v]]--;
            } else {
                rest.add(v + 1);
            }
        }
        Collections.reverse(rest);
        removeOrder.addAll(rest);
        return removeOrder
            .stream()
            .map(i -> "" + i)
            .collect(Collectors.joining("\n", "YES\n", ""));
    }
    
    private void topSort(int v, int p, List<Integer>[] tree, List<Integer> order) {
        for (int c : tree[v]) {
            if (c != p) {
                topSort(c, v, tree, order);
            }
        }
        order.add(v);
    }
}