Problem: We have a tree with N vertices numbered 1 to N. The i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i. Your objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:

* For any two vertices painted in the same color, the distance between them is an even number.



Find a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.

Constraints

* All values in input are integers.
* 1 \leq N \leq 10^5
* 1 \leq u_i < v_i \leq N
* 1 \leq w_i \leq 10^9

Input

Input is given from Standard Input in the following format:


N
u_1 v_1 w_1
u_2 v_2 w_2
.
.
.
u_{N - 1} v_{N - 1} w_{N - 1}


Output

Print a coloring of the vertices that satisfies the condition, in N lines. The i-th line should contain `0` if Vertex i is painted white and `1` if it is painted black.

If there are multiple colorings that satisfy the condition, any of them will be accepted.

Examples

Input

3
1 2 2
2 3 1


Output

0
0
1


Input

5
2 5 2
2 3 10
1 3 8
3 4 2


Output

1
0
1
0
1

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;


public class Main
{

	
	
	

	static OutputStream outputStream = System.out;
	static PrintWriter out = new PrintWriter(outputStream);

	static int inf=(int)2e9;



	static class node1
		{
			int data,weight;
			node1 link=null;
			node1(int d,int w)
			{
				data=d;weight=w;
			}
		}
		static class linkl
		{
			node1 front=null,end=null;
		
			void inst(int d,int w)
			{
				node1 newnode=new node1(d,w);
				if(front==null){front=newnode;end=newnode;}
				else
				{
					end.link=newnode;end=newnode;
				}
			}
		}
		static class node_4graph
		{
			linkl l;
			node_4graph()
			{
				l=new linkl();
			}
		}
		static class graph
		{
			node_4graph[] arr;int[] vis,col;
	
			graph(int n)
			{
				arr=new node_4graph[n];
				vis=new int[n];
				col=new int[n];

				for(int i=0;i<n;i++)
				{
					node_4graph lw=new node_4graph();
					arr[i]=lw;
				}
			}
			void insert(int x,int y,int w)
			{
				arr[x].l.inst(y,w);
				arr[y].l.inst(x,w);
			}
			void BFS()
			{
	
				for(int i=1;i<arr.length;i++)
				{
					if(vis[i]==0)
					{
						Queue<Integer> q=new LinkedList<Integer>();
	
						q.add(i);
						
						vis[i]=1;
						col[i]=1;
	
						while(q.size()!=0)
						{
							int u=q.poll();
							node1 temp=arr[u].l.front;
							while(temp!=null)
							{
								if(vis[temp.data]==0)
								{
									vis[temp.data]=1;
									q.add(temp.data);

									if(temp.weight%2==0) col[temp.data]=col[u];
									else if(col[u]==0) col[temp.data]=1;
									else col[temp.data]=0;
								}
								temp=temp.link;
							}
						}
						
					}
				}
				
			}
		
		}




	
	public static void main(String[] args)throws IOException{
		
			
			BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

			int n=Integer.parseInt(br.readLine());
			String[] s;

			graph gr=new graph(n);


			for(int i=0;i<n-1;i++)
			{
				s=br.readLine().split(" ");
				int fd=Integer.parseInt(s[0])-1;
				int df=Integer.parseInt(s[1])-1;
				gr.insert(fd,df,Integer.parseInt(s[2]));
					
			}

			gr.BFS();

						
			for(int i=0;i<n;i++) out.println(gr.col[i]);
			
			
			out.close();

	}
}