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

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        if (N == 1) {
            System.out.println(0);
            return;
        }
        List<Integer>[] graph = new List[N];
        for (int i = 0; i < N; i++) {
            graph[i] = new ArrayList<>();
        }
        Edge[] edges = new Edge[N-1];
        for (int i = 0; i < N-1; i++) {
            int u = scan.nextInt()-1;
            int v = scan.nextInt()-1;
            int w = scan.nextInt();
            graph[u].add(i);
            graph[v].add(i);
            Edge e = new Edge();
            e.id = i;
            e.from = u;
            e.to = v;
            e.weight = w;
            edges[i] = e;
        }
        int max_degree = 0;
        int root = -1;
        for (int i = 0; i < N; i++) {
            if (max_degree < graph[i].size()) {
                max_degree = graph[i].size();
                root = i;
            }
        }
        int[] colors = new int[N];
        Arrays.fill(colors, -1);
        boolean[] visited = new boolean[N];
        Queue<Integer> queue = new LinkedList<>();
        queue.add(root);
        colors[root] = 0;
        while(!queue.isEmpty()) {
            int node = queue.poll();
            int color = colors[node];
            visited[node] = true;
            for (int edge_id : graph[node]) {
                Edge e = edges[edge_id];
                int next = e.from == node ? e.to : e.from;
                if (visited[next]) {
                    continue;
                }
                if (e.weight % 2 == 1) {
                    colors[next] = (color + 1) % 2;
                } else {
                    colors[next] = color;
                }
                queue.add(next);
            }
        }
        for (int i = 0; i < N; i++) {
            System.out.println(colors[i]);
        }
    }
    class Edge {
        int id;
        int from;
        int to;
        int weight;
    }
}