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

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		Map<Integer,List<int[]>> map = new HashMap<>();
		for(int i=0;i<n-1;i++) {
			int[] tmp = new int[3];
			tmp[0] = in.nextInt();
			tmp[1] = in.nextInt();
			tmp[2] = in.nextInt();
			int[] tmp2 = new int[3];
			tmp2[0] = tmp[1];
			tmp2[1] = tmp[0];
			tmp2[2] = tmp[2];
			if(map.containsKey(tmp[0])) {
				map.get(tmp[0]).add(tmp);
			}else {
				List<int[]> list = new ArrayList<>();
				list.add(tmp);
				map.put(tmp[0], list);
			}
			if(map.containsKey(tmp2[0])) {
				map.get(tmp2[0]).add(tmp2);
			}else {
				List<int[]> list = new ArrayList<>();
				list.add(tmp2);
				map.put(tmp2[0], list);
			}
		}
		int[] ans = new int[n+1];
		for(int i=1;i<=n;i++) {
			ans[i] = -1;
		}
		ans[1] = 0;
		Queue<Integer> que = new ArrayDeque<>();
		que.add(1);
		while(!que.isEmpty()) {
			int tmp = que.poll();
			List<int[]> list = map.get(tmp);
			for(int[] edge : list) {
				if(ans[edge[1]]!=-1) continue;
				que.add(edge[1]);
				if(edge[2]%2==0) ans[edge[1]] = ans[edge[0]];
				else ans[edge[1]] = ans[edge[0]]==0?1:0;
			}
		}
		for(int i=1;i<=n;i++) {
			System.out.println(ans[i]);
		}
		in.close();
	}

}