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.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        try (CustomReader in = new CustomReader()) {
            new Main().execute(in);
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public void execute(CustomReader in) throws IOException {
        final int N = Integer.parseInt(in.readLine());
        int[] color = new int[N];
        HashMap<Integer, List<Edge>> g = new HashMap<>();
        for (int i = 1; i < N; i++) {
            int[] uvw = in.readLineAsIntArray();
            int u = uvw[0] - 1;
            int v = uvw[1] - 1;
            int w = uvw[2];
            Edge e1 = new Edge(u, v, w);
            Edge e2 = new Edge(v, u, w);
            if (!g.containsKey(u)) {
                g.put(u, new ArrayList<>());
            }
            if (!g.containsKey(v)) {
                g.put(v, new ArrayList<>());
            }
            g.get(u).add(e1);
            g.get(v).add(e2);
        }
        boolean[] visited = new boolean[N];
        color[0] = 0;
        visited[0] = true;
        int visitCnt = 1;
        int root = 0;
        dfs(0, g, color, visited);
        for (int i = 0; i < N; i++) {
            System.out.println(color[i]);
        }
    }

    private void dfs(int root, HashMap<Integer, List<Edge>> g, int[] color, boolean[] visited) {
        int rColor = color[root];
        List<Edge> next = g.getOrDefault(root, new ArrayList<>());
        for (Edge e : next) {
            if (!visited[e.to]) {
                if (e.weight % 2 == 0) {
                    color[e.to] = rColor;
                } else {
                    color[e.to] = reverse(rColor);
                }
                visited[e.to] = true;
                dfs(e.to, g, color, visited);
            }
        }
    }

    private int reverse(int col) {
        return (col == 0) ? 1 : 0;
    }

    static class Edge {
        public final int from;
        public final int to;
        public final int weight;

        public Edge(int u, int v, int w) {
            from = u;
            to = v;
            weight = w;
        }
    }

    static class CustomReader extends BufferedReader {

        public CustomReader() throws IOException {
            super(new InputStreamReader(System.in));
        }

        public int[] readLineAsIntArray() throws IOException {
            String[] strArray = this.readLine().split(" ");
            int[] intArray = new int[strArray.length];
            for (int i = 0, n = strArray.length; i < n; i++) {
                intArray[i] = Integer.parseInt(strArray[i]);
            }
            return intArray;
        }

        public int[][] readAsIntMatrix(int rows, int columns) throws IOException {
            int[][] matrix = new int[rows][columns];
            for (int i = 0; i < rows; i++) {
                String[] r = this.readLine().split(" ");
                for (int j = 0; j < columns; j++) {
                    matrix[i][j] = Integer.parseInt(r[j]);
                }
            }
            return matrix;
        }

    }
}