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 int n;
  static long[] d;
  static ArrayList[] e;
  static HashMap[] elen;
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    n = sc.nextInt();
    d = new long[n];
    e = new ArrayList[n];
    elen = new HashMap[n];
    for(int i = 0; i < n; i++) {
      ArrayList<Integer> list = new ArrayList<Integer>();
      e[i] = list;
      HashMap<Integer, Long> map = new HashMap<Integer, Long>();
      elen[i] = map;
    }
    for(int i = 0; i < n - 1; i++) {
      int u = sc.nextInt() - 1;
      int v = sc.nextInt() - 1;
      long w = sc.nextLong();
      
      ArrayList<Integer> list = e[u];
      ArrayList<Integer> list2 = e[v];
      HashMap<Integer, Long> map = elen[u];
      HashMap<Integer, Long> map2 = elen[v];
      
      list.add(v);
      list2.add(u);
      map.put(v, w);
      map2.put(u, w);
 
      e[u] = list;
      e[v] = list2;
      elen[u] = map;
      elen[v] = map2;
    }
    dfs(0, -1);
    for(int i = 0; i < n; i++) {
      if((d[i] % 2) == 0) {
        System.out.println(0);
      } else {
        System.out.println(1);
      }
    }
  }

  public static void dfs(int v, int p) {
    ArrayList<Integer> list = e[v];
    HashMap<Integer, Long> map = elen[v];
    for(int i = 0; i < list.size(); i++) {
      int u = list.get(i);
      if(u != p) {
        long dd = map.get(u);
        d[u] = d[v] + dd;
        dfs(u, v);
      }
    }
  }
}