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 {
	Scanner sc = new Scanner(System.in);
	final int MOD = 1000000007;
	Set<Integer> set;

	void doIt() {
		int n = sc.nextInt();
		ArrayList<Edge> e[] = new ArrayList[n];
		for(int i = 0; i < n; i++) {
			e[i] = new ArrayList<>();
		}
		for(int i = 1; i < n; i++) {
			int v = sc.nextInt() -1;
			int u = sc.nextInt() -1;
			int w = sc.nextInt();
			e[v].add(new Edge(u, w));
			e[u].add(new Edge(v, w));
		}
		int col[] = new int[n];
		Arrays.fill(col, -1);
		col[0] = 0;
		search(0, e, n, col);
		for(int i = 0; i < n; i++) {
			System.out.println(col[i]);
		}
	}

	void search(int idx, ArrayList<Edge>[] e, int n ,int col[]) {
		for(Edge i : e[idx]) {
			if(col[i.t] >= 0) continue;
			if(i.w % 2 == 0) {
				col[i.t] = col[idx];
				search(i.t, e, n, col);
			}
			else {
				col[i.t] = col[idx] ^ 1;
				search(i.t, e, n, col);
			}

		}
	}
	
	class Edge{
		int t, w;
		Edge(int to, int weight){
			t = to; w = weight;
		}
	}

	public static void main(String[] args) {
		new Main().doIt();
	}
}