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.*;

public class Main {
	static long[] distances;
	static ArrayList<Road>[] lists;
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		distances = new long[n];
		lists = new ArrayList[n];
		for (int i = 0; i < n; i++) {
			distances[i] = Long.MAX_VALUE;
			lists[i] = new ArrayList<Road>();
		}
		for (int i = 0; i < n - 1; i++) {
			int u = sc.nextInt();
			int v = sc.nextInt();
			int w = sc.nextInt();
			lists[u - 1].add(new Road(v - 1, w));
			lists[v - 1].add(new Road(u - 1, w));
		}
		int idx = 0;
		while (idx != -1) {
			search(idx, 0);
			idx = getNext();
		}
		StringBuilder sb = new StringBuilder();
		for (long x : distances) {
			if (x % 2 == 0) {
				sb.append(0);
			} else {
				sb.append(1);
			}
			sb.append("\n");
		}
		System.out.println(sb);
	}
	
	static int getNext() {
		for (int i = 0; i < distances.length; i++) {
			if (distances[i] == Long.MAX_VALUE) {
				return i;
			}
		}
		return -1;
	}
					
	static void search(int idx, long distance) {
		if (distances[idx] <= distance) {
			return;
		}
		distances[idx] = distance;
		for (Road r : lists[idx]) {
			search(r.dest, distance + r.weight);
		}
	}
	
	static class Road {
		int dest;
		int weight;
		
		public Road(int dest, int weight) {
			this.dest = dest;
			this.weight = weight;
		}
	}
}