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.*;
import java.math.BigInteger;
import java.util.*;

public class Main {

	public static class FastReader {
		BufferedReader br;
		StringTokenizer root;
		
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (root == null || !root.hasMoreTokens()) {
				try {
					root = new StringTokenizer(br.readLine());
				} catch (Exception addd) {
					addd.printStackTrace();
				}
			}
			return root.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception addd) {
				addd.printStackTrace();
			}
			return str;
		}
	}
	
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	
	public static FastReader sc = new FastReader();
 
	static int mod = (int) (1e9+7),MAX=(int) (3e5),k,n;
	static List<Integer>[] edges ;
    static long[] size;
    static long[][] dp;
	public static void main(String[] args) {
	  int n = sc.nextInt();
	  size = new long[n+1];
	  edges = new ArrayList[n+1];
	  for(int i=0;i<edges.length;++i) edges[i] = new ArrayList<>();
	  int root = -1;
	  for(int i=1;i<=n;++i) {
		  int p = sc.nextInt();
		  if(p == 0) root = i;
		  else edges[p].add(i);
	  }
	  if(n%2 == 0) out.println("NO");
	  else { out.println("YES");
	  dfs(root);
	  delete(root);
	  }
	  out.close();
	}
	
	private static void delete(int root) {
		for(int child : edges[root]) {
			if(size[child]%2 == 0)
				delete(child);
		}
		out.println(root);
		for(int child : edges[root]) {
			if(size[child]%2 != 0)
				delete(child);
		}
		
	}

	private static void dfs(int root) {
		size[root] = 1;
		for(int child : edges[root]) {
			dfs(child);
			size[root]+=size[child];
		}
		
	}
	
}
