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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.nextLine());
		HashMap<Integer, HashMap<Integer, Integer>> edge = new HashMap();
		for (int i=0 ;i<n-1; i++) {
			String[] arr = sc.nextLine().split(" ");
			int u = Integer.parseInt(arr[0]);
			int v = Integer.parseInt(arr[1]);
			int w = Integer.parseInt(arr[2]);

			if (! edge.containsKey(u-1)) {
				edge.put(u-1, new HashMap<Integer, Integer>());
			}
			edge.get(u-1).put(v-1, w);
			if (! edge.containsKey(v-1)) {
				edge.put(v-1, new HashMap<Integer, Integer>());
			}
			edge.get(v-1).put(u-1, w);
		}
		sc.close();

		int[] res = new int[n];
		Arrays.fill(res, -1);
		LinkedList<Integer> stack = new LinkedList<Integer>();
		stack.push(0);
		res[0] = 0;

		while(! stack.isEmpty()) {
			int target = stack.pop();
			for(int key: edge.get(target).keySet()) {
				if (res[key] != -1) {
					continue;
				}
				stack.push(key);
				if (edge.get(target).get(key) % 2 == 0) {
					res[key] = res[target];
				} else {
					res[key] = res[target] == 0 ? 1 : 0;
				}
			}
		}
		for(int i=0; i<n; i++) {
			System.out.println(res[i]);
		}
	}
}