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 {

  public static void main(String args[]) {
    int rep = 1;
    if( args.length > 0 ) { rep = Integer.parseInt(args[0]); }
    (new Main()).__solve(rep);
  }

  void __solve(int rep) {

    try (
      Scanner cin = new Scanner(System.in);
    ) {

      for( int i = 0; i < rep; ++i ) {
        __solve(cin);
      }

    }

  }

  void __solve(Scanner cin) {
	  int N = cin.nextInt();
	  List<int[]> all[] = new List[N];
	  for( int i = 0; i < N; ++i ) {
		  all[i] = new ArrayList<int[]>();
	  }
	  for( int i = 0; i < N - 1; ++i ) {
		  int v = cin.nextInt() - 1;
		  int u = cin.nextInt() - 1;
		  int d = cin.nextInt() & 1;
		  all[u].add(new int[] { v, d });
		  all[v].add(new int[] { u, d });
	  }
	  int ans[] = new int[N];
	  boolean vis[] = new boolean[N];
	  int queue[] = new int[N];
	  int q = 0;
	  queue[q++] = 0;
	  vis[0] = true;
	  for( int i = 0; i < q; ++i ) {
		  int cur = queue[i];
		  for( int edge[] : all[cur] ) {
			  // parent;
			  if( vis[ edge[0] ] ) { continue; }
			  vis[ edge[0] ] = true;
			  ans[ edge[0] ] = ans[cur] ^ edge[1];
			  queue[q++] = edge[0];
		  }
	  }
	  for( int i = 0; i < N; ++i ) {
		  System.out.println(ans[i]);
	  }
  }

}