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.io.*;

public class Main {
	public static void main(String args[]) {new Main().run();}

	FastReader in = new FastReader();
	PrintWriter out = new PrintWriter(System.out);
	void run(){
		work();
		out.flush();
	}
	long mod=1000000007;
	long gcd(long a,long b) {
		return a==0?b:b>=a?gcd(b%a,a):gcd(b,a);
	}
	int[] count;
	ArrayList<Integer>[] graph;
	void work() {
		int n=in.nextInt();
		if(n%2==0) {
			out.println("NO");
			return;
		}else {
			out.println("YES");
		}
		count=new int[n];
		graph=(ArrayList<Integer>[])new ArrayList[n];
		for(int i=0;i<n;i++)graph[i]=new ArrayList<>();
		for(int i=0;i<n;i++) {
			int s=in.nextInt()-1;
			if(s==-1)continue;
			graph[s].add(i);
			graph[i].add(s);
		}
		dfs1(0,new boolean[n]);
		dfs2(0,new boolean[n]);
	}
	private void dfs2(int node, boolean[] vis) {
		vis[node]=true;
		for(int nn:graph[node]) {
			if(!vis[nn]&&count[nn]%2==0) {
				dfs2(nn,vis);
			}
		}
		out.println(node+1);
		for(int nn:graph[node]) {
			if(!vis[nn]&&count[nn]%2==1) {
				dfs2(nn,vis);
			}
		}
	}
	private int dfs1(int node, boolean[] vis) {
		vis[node]=true;
		int cnt=1;
		for(int nn:graph[node]) {
			if(!vis[nn]) {
				cnt+=dfs1(nn,vis);
			}
		}
		count[node]=cnt;
		return cnt;
	}
}	



class FastReader
{
	BufferedReader br;
	StringTokenizer st;

	public FastReader()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}


	public String next() 
	{
		while(st==null || !st.hasMoreElements())//回车，空行情况
		{
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

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

	public long nextLong()
	{
		return Long.parseLong(next());
	}
}