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.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {
	Scanner sc = new Scanner(System.in);
	
	public static void main(String[] args) {
		Main m = new Main();
		m.run();
	}
	
	void run() {
		
		int n = sc.nextInt();
		int u[] = new int[n];
		int v[] = new int[n];
		int w[] = new int[n];
		
		Map<Integer,List<Integer>> g = new HashMap<Integer,List<Integer>>();
		
		for(int i = 0; i < n-1;i++) {
			u[i] = sc.nextInt()-1;
			v[i] = sc.nextInt()-1;
			w[i] = sc.nextInt();
			
			g.computeIfAbsent(u[i], x -> new ArrayList<Integer>()).add(i);
			g.computeIfAbsent(v[i], x -> new ArrayList<Integer>()).add(i);
		}
		
		int current = 0;
		int color = 0;
		int[] res = new int[n];
		Arrays.fill(res, -1);
		res[0] = 0;
		coloring(g,res,current,color,u,v,w);
		
		for(int i =0 ;i < n;i++) {
			System.out.println(res[i]);
		}
	}
	
	
	void coloring(Map<Integer,List<Integer>> g,int[] res, int current,int color, int[]u,int v[],int[] w) {
		for(int nextv : g.get(current)) {
			int next = u[nextv]+v[nextv]-current;	
			if(res[next] != -1) {
				continue;
			}
			int nextColor= (color + w[nextv])%2;
			res[next] = nextColor;
			
			coloring(g,res,next,nextColor,u,v,w);
		}
	}
}