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.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

    private static class Node {
        int u;
        int v;
        long w;

        public Node(int u, int v, long w) {
            this.u = u;
            this.v = v;
            this.w = w;
        }
    }

    private static int inverse(int n) {
        if (n % 2 == 0) {
            return 1;
        }
        return 0;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Map<Integer, List<Node>> uvw = new HashMap<>();
        for (int i = 1; i <= n; i++) {
            uvw.put(i, new ArrayList<>());
        }
        for (int i = 0; i < n - 1; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            long w = sc.nextLong();
            List<Node> nodeu = uvw.get(u);
            nodeu.add(new Node(u, v, w));
            uvw.put(u, nodeu);
            List<Node> nodev = uvw.get(v);
            nodev.add(new Node(v, u, w));
            uvw.put(v, nodev);
        }
        int[] color = new int[n + 1];
        Arrays.fill(color, -1);
        for (int i = 1; i <= n; i++) {
            Deque<Node> queue = new ArrayDeque<>();
            if (color[i] == -1) {
                color[i] = 0;
                for (Node node : uvw.get(i)) {
                    queue.add(node);
                }
            }
            while (!queue.isEmpty()) {
                int size = queue.size();
                for (int j = 0; j < size; j++) {
                    Node node = queue.poll();
                    if (node.w % 2 == 0) {
                        color[node.v] = color[node.u];
                    } else {
                        color[node.v] = inverse(color[node.u]);
                    }
                    for (Node next : uvw.get(node.v)) {
                        if (color[next.v] == -1) {
                            queue.add(next);
                        }
                    }
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(color[i]);
        }
    }

}