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.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][][] g = buildWeightedGraph(n, sc);
        ArrayDeque<Integer> ad = new ArrayDeque<>();
        ad.add(0);
        int[] ans = new int[n];
        boolean[] used = new boolean[n];
        used[0] = true;
        while(!ad.isEmpty()){
            int x = ad.poll();
            int[][] next = g[x];
            for(int[] nv : next){
                if(used[nv[0]]) continue;
                used[nv[0]] = true;
                ans[nv[0]] = nv[1] % 2 == 0 ? ans[x] : Math.abs(ans[x] - 1);
                ad.add(nv[0]);
            }
        }
        for (int i = 0; i < n; i++) System.out.println(ans[i]);
        sc.close();

    }

    public static int[][][] buildWeightedGraph(int n, Scanner sc){
        int m = n-1;
        int[][][] graph = new int[n][][];
        int[][] edges = new int[n-1][3];
        int[] deg = new int[n];
        for (int i = 0; i < m; i++) {
            edges[i][0] = sc.nextInt()-1;
            edges[i][1] = sc.nextInt()-1;
            edges[i][2] = sc.nextInt();
            deg[ edges[i][0] ]++;
            deg[ edges[i][1] ]++;
        }
        for (int i = 0; i < n; i++) {
            graph[i] = new int[deg[i]][2];
        }
        for (int i = 0; i < m; i++) {
            int a = edges[i][0];
            int b = edges[i][1];
            int c = edges[i][2];
            graph[a][--deg[a]][0] = b;
            graph[a][deg[a]][1] = c;
            graph[b][--deg[b]][0] = a;
            graph[b][deg[b]][1] = c;
        }

        return graph;
    }

}