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.LinkedList;
import java.util.Queue;

public class Main {
    static int[] painted;
    static Queue[] a;
    public static void main(String args[]) throws Exception{
        BufferedReader stdR = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(stdR.readLine());
        a = new Queue[N];
        for(int i = 0 ; i < N ; i++) {
            a[i] = new LinkedList<String>();
        }
        painted = new int[N];//0 undef 1 white 2 black
        Queue<String> q = new LinkedList<String>();
        for(int i = 0 ; i < N - 1 ; i++) {
            String[] strs = stdR.readLine().split(" ");
            int u = Integer.parseInt(strs[0]) - 1;
            int v = Integer.parseInt(strs[1]) - 1;
            int w = Integer.parseInt(strs[2]);
            if(u > v) {
                int tmp = u;
                u = v;
                v = tmp;
            }
            a[u].add(v+" "+w);
            a[v].add(u+" "+w);
        }
        String[] s = a[0].poll().toString().split(" ");
        int v = Integer.parseInt(s[0]);
        int w = Integer.parseInt(s[1]);
        if(w % 2 == 0) {
            painted[0] = 1;
            painted[v] = 1;
        }else {
            painted[0] = 1;
            painted[v] = 2;
        }
        //System.out.println(v);
        painter(v);
        
        for(int i = 0 ; i < N ; i++) {
            System.out.println(painted[i] - 1);
        }
    }
    
    public static void painter(int u) {
        while(!a[u].isEmpty()) {
            String[] s = a[u].poll().toString().split(" ");
            int v = Integer.parseInt(s[0]);
            int w = Integer.parseInt(s[1]);
            //System.out.println(u+","+v+","+w+","+a[u].size());
            if(w % 2 == 0) {
                if(painted[u] == 1) {
                    painted[v] = 1;
                }else {
                    painted[v] = 2;
                }
            }else {
                if(painted[u] == 1) {
                    painted[v] = 2;
                }else {
                    painted[v] = 1;
                }
            }
            painter(v);
        }
    }
}