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

public class Main
{
    public static void main(String[] args)throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//        Scanner input = new Scanner(System.in);
        int n = Integer.parseInt(br.readLine());
        int i,a,b,c;
        int []color = new int[n+1];
        Set<Integer> done = new HashSet<>();
        for(i=1;i<n+1;i++){
            color[i] = 0;
    }
        EvenRataion []mark = new EvenRataion[n+1];
        for(i=1;i<n+1;i++){
            mark[i] = new EvenRataion();
        }
        for(i=0;i<n-1;i++){
            String[] in = br.readLine().split(" ");
            a = Integer.parseInt(in[0]);
            b = Integer.parseInt(in[1]);
            c = Integer.parseInt(in[2]);
            if (c%2==0){
                mark[a].even.add(b);
                mark[b].even.add(a);
            }
            else {
                mark[a].odd.add(b);
                mark[b].odd.add(a);
            }
        }
        List<Integer> run = new ArrayList<>();
        run.add(1);
        List<Integer> temp = new ArrayList<>();
        while (run.size()>0){
            int y = run.get(0);
            run.remove(0);
            done.add(y);
            if (color[y]==0){
                for(int v:mark[y].odd){
                    if(!done.contains(v)){
                        run.add(v);
                        color[v] = 1;
                        temp.add(v);
                    }
                }
                for(int v:mark[y].even){
                    if(!done.contains(v)){
                        temp.add(v);
                    }
                }
            }
            else{
                for(int v:mark[y].even){
                    if(!done.contains(v)){
                        run.add(v);
                        color[v] = 1;
                        temp.add(v);
                    }
                }
                for(int v:mark[y].odd){
                    if(!done.contains(v)){
                        temp.add(v);
                    }
                }

            }
            if(run.size()==0){
                run.addAll(temp);
                temp.clear();
            }
        }
        for(i=1;i<n+1;i++){
            System.out.println(color[i]);
    }
    }
    static class EvenRataion{
        Set<Integer> even = new HashSet<>();
        Set<Integer> odd = new HashSet<>();

    }
}