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.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;
import java.io.IOException;

public class Main {
    static class Edge {
        int to;
        boolean odd;

        Edge(int to, boolean odd) {
            this.to = to;
            this.odd = odd;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());
        List<List<Edge>> edges = new ArrayList<>();
        for(int i = 0; i < n; i++) {
            edges.add(new ArrayList<>());
        }
        for(int i = 0; i < n - 1; i++) {
            String[] in = br.readLine().split(" ");
            int u = Integer.parseInt(in[0]) - 1;
            int v = Integer.parseInt(in[1]) - 1;
            int w = Integer.parseInt(in[2]);
            boolean odd = w % 2 == 1;
            edges.get(u).add(new Edge(v, odd));
            edges.get(v).add(new Edge(u, odd));
        }

        boolean[] odd = new boolean[n];
        Stack<Integer> stack = new Stack<>();
        stack.push(0);
        boolean[] checked = new boolean[n];
        checked[0] = true;
        while(!stack.isEmpty()) {
            int s = stack.pop();
            for(Edge e : edges.get(s)) {
                if(!checked[e.to]) {
                    odd[e.to] = odd[s] ^ e.odd;
                    stack.push(e.to);
                    checked[e.to] = true;
                }
            }
        }


        for(int i = 0; i < n; i++) {
            System.out.println(odd[i]? '1': '0');
        }

        br.close();
    }
}