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

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

        Map<Integer, List<NodeAndDistance>> distanceMap = new HashMap<>();

        for (int i = 0; i < n - 1; i++) {
            final int x = scanner.nextInt();
            final int y = scanner.nextInt();
            final int distance = scanner.nextInt();

            distanceMap.computeIfAbsent(x, e -> new ArrayList<>())
                    .add(new NodeAndDistance(y, distance));
            distanceMap.computeIfAbsent(y, e -> new ArrayList<>())
                    .add(new NodeAndDistance(x, distance));
        }

        final int[] array = new int[n];
        final boolean[] checked = new boolean[n];
        recursive(distanceMap, distanceMap.get(1), 0, array, checked);

        for (final int i : array) {
            System.out.println(i);
        }
    }

    private static void recursive(final Map<Integer, List<NodeAndDistance>> distanceMap, final List<NodeAndDistance> nodeAndDistanceList, final int distanceFormParent, final int[] array, final boolean[] checked) {
        for (final NodeAndDistance nodeAndDistance : nodeAndDistanceList) {
            final int node = nodeAndDistance.getNode();
            if (node == 1 || checked[node - 1]) {
                continue;
            }

            final int distance = nodeAndDistance.getDistance() + distanceFormParent;
            array[node - 1] = distance % 2;
            checked[node - 1] = true;
            recursive(distanceMap, distanceMap.get(node), distance, array, checked);
        }
    }

    static class NodeAndDistance {
        private final int node;
        private final int distance;

        NodeAndDistance(final int node, final int distance) {
            this.node = node;
            this.distance = distance % 2;
        }

        int getNode() {
            return node;
        }

        int getDistance() {
            return distance;
        }
    }
}