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.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
static HashMap<Integer,Integer> set=new HashMap<>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scn = new Scanner(System.in);
		int n = scn.nextInt();
		HashMap<Integer, ArrayList<Integer>> hmap = new HashMap<>();
		HashMap<Integer, ArrayList<Integer>> weights = new HashMap<>();

		for (int i = 0; i < n-1; i++) {
			int u = scn.nextInt();
			int v = scn.nextInt();
			int w = scn.nextInt();
			if (hmap.containsKey(u)) {
				ArrayList<Integer> al=hmap.get(u);
				ArrayList<Integer> w1=weights.get(u);	
				w1.add(w);
				weights.put(u, w1);
				al.add(v);
				hmap.put(u,al);
			} else {
				ArrayList<Integer> al=new ArrayList<>();
				al.add(v);
				ArrayList<Integer> w1=new ArrayList<>();	
				w1.add(w);
				weights.put(u, w1);
				hmap.put(u,al);
			}
			if (hmap.containsKey(v)) {
				ArrayList<Integer> al=hmap.get(v);
				al.add(u);
				ArrayList<Integer> w1=weights.get(v);	
				w1.add(w);
				weights.put(v, w1);
				hmap.put(v,al);
			} else {
				ArrayList<Integer> al=new ArrayList<>();
				al.add(u);
				ArrayList<Integer> w1=new ArrayList<>();	
				w1.add(w);
				weights.put(v, w1);
				hmap.put(v,al);
			}
		}
		HashSet<Integer> visited =new HashSet<>();
		for(int i=1;i<=n;i++) {
			if(!visited.contains(i)) {
				solve(hmap,weights,visited,i,0);
			}
		}
		for(int x=1;x<=n;x++) {
			System.out.println(set.get(x));
		}
	}
	
	public static void solve(HashMap<Integer, ArrayList<Integer>> hmap,HashMap<Integer, ArrayList<Integer>> weights, HashSet<Integer> visited, int ele, int color) {
		visited.add(ele);
		set.put(ele, color);
		//System.out.println(color+" "+ele);
		ArrayList<Integer> a=hmap.get(ele);
		ArrayList<Integer> w=weights.get(ele);
		for(int i=0;a!=null &&i<a.size();i++) {
			if(!visited.contains(a.get(i))) {
				if(w.get(i)%2==0)
					solve(hmap,weights,visited,a.get(i),color);
				else
					solve(hmap,weights,visited,a.get(i),color==1?0:1);
				
				//System.out.println("ret "+ele);
			}
		}
	}

}