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

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    int N = scanner.nextInt();
    Node[] nodes = new Node[N];
    for (int i = 0; i < N; i++) nodes[i] = new Node(i);

    for (int i = 0; i < N - 1; i++) {
      int u = scanner.nextInt() - 1;
      int v = scanner.nextInt() - 1;
      int w = scanner.nextInt();
      Edge e = new Edge(u ^ v, w);
      nodes[u].edges.add(e);
      nodes[v].edges.add(e);
    }

    dfs(nodes[0], null, 0, nodes);

    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < N; i++) {
      sb.append(nodes[i].color).append('\n');
    }
    System.out.print(sb.toString());
  }

  private static void dfs(Node node, Node from, int color, Node[] nodes) {
    node.color = color;
    for (Edge e : node.edges) {
      Node to = nodes[e.d ^ node.id];
      if (to != from) {
        int c = e.w % 2 == 0 ? node.color : 1 - node.color;
        dfs(to, node, c, nodes);
      }
    }
  }

  private static class Node {
    private final int id;
    private int color;
    List<Edge> edges = new ArrayList<>();

    private Node(int id) {
      this.color = -1;
      this.id = id;
    }
  }

  private static class Edge {
    private final int w;
    private final int d;

    private Edge(int d, int w) {
      this.d = d;
      this.w = w;
    }
  }
}