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

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] u = new int[N-1];
		int[] v = new int[N-1];
		int[] w = new int[N-1];
		ArrayList<List<Integer>> edge_1 = new ArrayList<List<Integer>>();
		for (int i=0;i<N;i++) {
			List<Integer> x = new ArrayList<Integer>();
			edge_1.add(x);
		}
		for (int i=0;i<N-1;i++) {
			u[i]=Integer.parseInt(sc.next())-1;
			v[i]=Integer.parseInt(sc.next())-1;
			w[i]=Integer.parseInt(sc.next());
			edge_1.get(u[i]).add(u[i]);
			edge_1.get(u[i]).add(v[i]);
			edge_1.get(u[i]).add(w[i]);
			edge_1.get(v[i]).add(v[i]);
			edge_1.get(v[i]).add(u[i]);
			edge_1.get(v[i]).add(w[i]);
		}
		int[] ans = new int[N];
		Arrays.fill(ans,-1);



		Queue<int[]> queue_1 = new ArrayDeque<int[]>();
		ans[0]=0;
		int M = edge_1.get(0).size();
		for (int i=0;i<M/3;i++) {
			int a_i=edge_1.get(0).get(3*i);
			int b_i=edge_1.get(0).get(3*i+1);
			int c_i=edge_1.get(0).get(3*i+2);
			int d_i=(c_i+ans[a_i])%2;
			if (d_i==0) {
				ans[b_i]=0;
			} else {
				ans[b_i]=1;
			}
			int[] add_init = {a_i,b_i,d_i};
			queue_1.add(add_init);

/*			int O = edge_1.get(b_i).size();
			System.out.println(O);
			for (int j=0;j<O/3;j++) {
				int a_j=edge_1.get(b_i).remove(0);
				int b_j=edge_1.get(b_i).remove(0);
				int c_j=edge_1.get(b_i).remove(0);
				int d_j=(c_j+ans[a_j])%2;
				if (ans[b_j]==-1) {
					int[] add = {a_j,b_j,d_j};
					queue_1.add(add);
				}
			}
*/		}

		while(!queue_1.isEmpty()) {
			int[] rem=queue_1.remove();
			int U_x=rem[0];
			int V_x=rem[1];
			int W_x=rem[2];

			int P = edge_1.get(V_x).size();
			for (int i=0;i<P/3;i++) {
				int a_i=edge_1.get(V_x).get(3*i);
				int b_i=edge_1.get(V_x).get(3*i+1);
				int c_i=edge_1.get(V_x).get(3*i+2);
				int d_i=(c_i+W_x)%2;
				if (ans[b_i]==-1) {
					if (d_i==0) {
						ans[b_i]=0;
					} else {
						ans[b_i]=1;
					}
					int[] add = {a_i,b_i,d_i};
					queue_1.add(add);
				}
/*				int O = edge_1.get(b_i).size();
				System.out.println(O);
				for (int j=0;j<O/3;j++) {
					int a_j=edge_1.get(b_i).get(3*j);
					int b_j=edge_1.get(b_i).get(3*j+1);
					int c_j=edge_1.get(b_i).get(3*j+2);
					int d_j=(c_j+ans[a_j])%2;
					if (ans[b_j]==-1){
						int[] add = {a_j,b_j,d_j};
						queue_1.add(add);
					}
				}
*/			}
		}
		for (int i=0;i<ans.length;i++) {
			System.out.println(ans[i]);
		}
	}
}