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.PrintStream;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class Main {
    static final Scanner     sc = new Scanner(System.in);
    static final PrintStream so = System.out;

    static final int WHITE = 0;
    static final int BLACK = 1;
    static final int INF = Integer.MAX_VALUE;
    
    public static void main(String[] args) throws InterruptedException {
        int n = ni();
        int[] color = new int[n+1];
        boolean[] visited = new boolean[n+1];
        Map<Integer, Map<Integer, Integer>> cost = new HashMap<>();
        
        for (int i = 0; i <= n; i++) {
            cost.put(i, new HashMap<>());
        }
        
        
        for (int i = 0; i < n-1; i++) {
            int ui = ni();
            int vi = ni();
            int wi = ni();
            cost.get(ui).put(vi, wi);
            cost.get(vi).put(ui, wi);
        }
        
        Deque<Integer> deque = new ArrayDeque<>();
        deque.addLast(1);
        color[1] = WHITE;
        
        while (!deque.isEmpty()) {
            Integer first = deque.pollFirst();
            visited[first] = true;
            Map<Integer, Integer> costFromFirst = cost.get(first);
            
            for (Integer next : costFromFirst.keySet()) {
                if (!visited[next]) {
                    deque.addLast(next);
                    color[next] = costFromFirst.get(next) % 2 == 0 ? color[first] : changeColor(color[first]);
                    visited[next] = true;
                }
            }
        }
        
        for (int i = 1; i <= n; i++) {
            so.println(color[i]);
        }
    }
    
    static int changeColor(int color) {
        return color == BLACK ? WHITE : BLACK;
    }
    
    private static int ni() {
        return sc.nextInt();
    }

    private static long nl() {
        return sc.nextLong();
    }

    private static String ns() {
        return sc.next();
    }

    private static char[] nsToChars() {
        return sc.next().toCharArray();
    }

    private static int[] nints(int n) {
        return nints(n, 0);
    }

    private static int[] nints(int n, int padding) {
        int[] a = new int[padding + n];
        for (int i = 0; i < n; i++)
            a[padding + i] = ni();
        return a;
    }
}