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

public class Main {

    static final int modnum = 1000000007;

    public static void main(String[] args) {
        ArrayList<Node> node = new ArrayList<Node>();
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        for (int i = 1; i <= N; i++) {
            node.add(new Node(node, i));
        }

        for (int i = 1; i < N; i++) {
            int p1 = sc.nextInt();
            int p2 = sc.nextInt();
            int length = sc.nextInt();
            node.get(p1 - 1).addEdge(p2, length);
            node.get(p2 - 1).addEdge(p1, length);
        }

        for (int i = 0; i < N; i++) {
            if (node.get(i).isLeaf) {
                node.get(i).setParent(0, 0);
                break;
            }
        }

        for (int i = 0; i < N; i++) {
            System.out.println(node.get(i).isBlack ? 1 : 0);
        }
    }
}

class Node {
    final int number;
    boolean isLeaf = true;
    boolean isBlack = false;
    int parent = 0;

    ArrayList<Node> node;

    ArrayList<Integer> edge = new ArrayList<Integer>();
    ArrayList<Boolean> even = new ArrayList<Boolean>();

    Node(ArrayList<Node> node, int number) {
        this.node = node;
        this.number = number;
    }

    void addEdge(int n, int length) {
        edge.add(n);
        even.add(length % 2 == 0);

        if (edge.size() == 1)
            isLeaf = true;
        else
            isLeaf = false;
    }

    void setParent(int p, int odds) {
        parent = p;
        if (odds % 2 != 0)
            isBlack = true;
        for (int i = 0; i < edge.size(); i++) {
            if (edge.get(i) == p)
                continue;
            int nextodds = even.get(i) ? odds : odds + 1;
            node.get(edge.get(i) - 1).setParent(number, nextodds);
        }
    }

}