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 dfs(int color, int index, List<Edge> es, ArrayList<Integer> colors,ArrayList<ArrayList<Edge>> nodes){
       if(colors.get(index) != 100)
           return;
       colors.set(index,color);
       ArrayList<Edge> edges = nodes.get(index);
       for(int i = 0;i < edges.size();i++){
           Edge e = edges.get(i);
           if(e == null)
               break;
           if(e.from == index) {
               if (e.weight % 2 == 0){
                   dfs(color, e.to, es, colors,nodes);
               }
               else{
                   dfs(1 - color, e.to,es, colors,nodes);
               }
           }
           else if(e.to == index){
               if(e.weight % 2 == 0){
                   dfs(color,e.from,es,colors,nodes);
               }
               else{
                   dfs(1 - color,e.from,es,colors,nodes);
               }
           }
       }
    }

    public static void main(String[] args) {
        // write your code here
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        ArrayList<Edge> edges = new ArrayList<>();
        ArrayList<ArrayList<Edge>> nodes = new ArrayList<>();

        for(int j = 0;j < N;j++)
            nodes.add(new ArrayList<>());

        for(int i = 0;i < N - 1; i++) {
            int u, v;
            long w;
            u = sc.nextInt() - 1;
            v = sc.nextInt() - 1;
            w = sc.nextLong();

            Edge e = new Edge(u,v,w);
            nodes.get(u).add(e);
            nodes.get(v).add(e);

            edges.add(e);
        }
        ArrayList<Integer> colors = new ArrayList<>(Collections.nCopies(N + 1,100));
        dfs(0,edges.get(0).from,edges,colors,nodes);


        for(int i = 0; i < N;i++)
            System.out.println(colors.get(i));
    }



  public static class Edge{
        int from;
        int to;
        long weight;

        Edge(int f,int t,long w){
            from = f;
            to = t;
            weight = w;
        }
    }






    public static Integer min(List<Integer> ar){
        int min = 10000;
        int index = 0;
        for(int i = 0; i< ar.size();i++){
            if(min > ar.get(i)){
                min = ar.get(i);
                index = i;
            }
        }
        return min;
    }
}