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.Scanner;
import java.util.ArrayList;

public class Main {
	
	static ArrayList<Pair>[] adjList;
	static boolean[] vis;
	static int[] color;
	
	public static void dfs(int u) {
		vis[u] = true;
		
		for(Pair p : adjList[u]) {
			if(!vis[p.v]) {
				color[p.v] = p.w % 2 == 0 ? color[u] : 1 - color[u];
				dfs(p.v);
			}
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		adjList = new ArrayList[n];
		for(int i = 0; i < adjList.length; i++)
			adjList[i] = new ArrayList<Pair>();
		
		for(int i = 0; i < n - 1; i++) {
			int u = sc.nextInt(), v = sc.nextInt(), w = sc.nextInt();
			adjList[u - 1].add(new Pair(v - 1, w));
			adjList[v - 1].add(new Pair(u - 1, w));
		}
		
		vis = new boolean[n];
		color = new int[n];
		
		dfs(0);
		for(int i = 0; i < color.length; i++)
			System.out.println(color[i]);
	}
	
	public static class Pair implements Comparable<Pair>{
		int v, w;
		
		public Pair(int v) {
			this.v = v;
		}
		
		public Pair(int v, int w) {
			this(v);
			this.w = w;
		}
		
		public int compareTo(Pair p) {
			if(this.w == p.w)
				return this.v - p.v;
			return this.w - p.w;
		}
	}
}