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

public class Main{
	
	static int n ;
	static List<ArrayList<Edge>> Node;
	static int []colar;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		n = Integer.parseInt(sc.next());
		
		Node = new ArrayList<ArrayList<Edge>>();
		colar = new int [n];
		
		for(int i = 0 ; i < n ;i++) {
			Node.add(new ArrayList<Edge>());
		}
		
		for(int i = 0 ;i < n-1 ;i++) {
			int v = Integer.parseInt(sc.next());
			int u = Integer.parseInt(sc.next());
			int l = Integer.parseInt(sc.next());
			
			Node.get(v-1).add(new Edge(u-1,l));
			Node.get(u-1).add(new Edge(v-1,l));
		}
		for(int i = 0 ; i < n ;i++) {
			colar[i] = -1;						//まだ色を塗っていないとして初期化
		}
		
		colar[0] = 0;							//原点をまずは色を塗る
		dfs(0);
		
		for(int i = 0 ; i < n ;i++) {
			System.out.println(colar[i]);
		}

	}
	
	static void dfs(int from) {
		
		for(Edge e: Node.get(from)) {
			if(colar[e.getTo()] != -1) {
				continue;
			}
			if(e.getLength() % 2 == 0) {
				colar[e.getTo()] = colar[from];
				dfs(e.getTo());
			}
			else {
				colar[e.getTo()] =(colar[from] + 1)%2;
				dfs(e.getTo());
			}
		}
	}

}



class Edge{
	private int to ;
	private int lenght;
	
	public Edge( int to , int lenght) {
		this.to = to;
		this.lenght = lenght;
	}
	public int getTo() {
		return to;
	}
	public int getLength() {
		return lenght;
	}
	
}