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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.AbstractCollection;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.HashMap;
import java.util.LinkedList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        D solver = new D();
        solver.solve(1, in, out);
        out.close();
    }

    static class D {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            Map<Integer, Map<Integer, Integer>> lines = new HashMap<>();

            for (int i = 0; i < N - 1; i++) {
                int v1 = in.nextInt();
                int v2 = in.nextInt();
                long w = in.nextLong();
                if (!lines.containsKey(v1)) {
                    lines.put(v1, new HashMap<>());
                }
                if (!lines.containsKey(v2)) {
                    lines.put(v2, new HashMap<>());
                }
                lines.get(v1).put(v2, (int) (w % 2));
                lines.get(v2).put(v1, (int) (w % 2));
            }

            int[] black = new int[N + 1];
            Arrays.fill(black, -1);
            black[1] = 0;
            LinkedList<Integer> que = new LinkedList<>();
            que.add(1);
            while (!que.isEmpty()) {
                int current = que.removeFirst();
                if (!lines.containsKey(current)) {
                    continue;
                }
                for (Map.Entry<Integer, Integer> entry : lines.get(current).entrySet()) {
                    if (black[entry.getKey()] != -1) {
                        continue;
                    }
                    que.add(entry.getKey());
                    black[entry.getKey()] = (black[current] + entry.getValue()) % 2;
                }
            }
            for (int i = 1; i <= N; i++) {
                out.println(black[i]);
            }
        }

    }
}