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.ArrayDeque;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int edge[][] = new int[n-1][3];
		List<int[]>[] link = new List[n];
		for(int i=0; i<n; i++) {
			link[i] = new LinkedList<int[]>();
		}
		int[] color = new int[n];
		Arrays.fill(color, -1);

		int u, v, w;
		for(int i=0; i<n-1; i++) {
			u=sc.nextInt()-1;
			v=sc.nextInt()-1;
			w=sc.nextInt();
			edge[i][0]=u;
			edge[i][1]=v;
			edge[i][2]=w;
		}
		for(int i=0; i<n-1; i++) {
			link[edge[i][0]].add(edge[i]);
			link[edge[i][1]].add(edge[i]);
		}
		Queue<Integer> q= new ArrayDeque<>();
		q.add(0);
		color[0]=0;
		int next;
		int p;
		while(q.size()!=0) {
			p = q.poll();
			for(int[] l: link[p]) {
				if(l[0]==p) next=l[1];
				else next=l[0];
				if(color[next]>=0) continue;
				q.add(next);
				color[next]=color[p]^l[2]%2;
			}
		}
		for(int c: color)
			System.out.println(c);
	}
}