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 static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		int n = sc.nextInt();
		ArrayList<Edge>[] list = new ArrayList[n+1];
		for(int i = 1; i <= n; i++){
		    list[i] = new ArrayList<Edge>();
		}
		for(int i = 1; i < n; i++){
		    int u = sc.nextInt();
		    int v = sc.nextInt();
		    int w = sc.nextInt();
		    if(w%2 == 0){
		        w = 1;
		    }else{
		        w = -1;
		    }
		    /*if(u > v){
		        int temp = u;
		        u = v;
		        v = temp;
		    }*/
		    list[u].add(new Edge(u, v, w));
		    list[v].add(new Edge(v, u, w));
		}
		
		// 計算
		int[] result = new int[n+1];
		ArrayDeque<Integer> q = new ArrayDeque<Integer>();
		q.add(1);
		while(!q.isEmpty()){
		    int now = q.poll();
		    if(result[now] == 0) result[now] = 1;
		    for(Edge e : list[now]){
		        int i = e.v;
		        if(result[i] != 0) continue;
		        result[i] = result[now]*e.w;
		        q.add(i);
		    }
		}
		
		// 出力
        for(int i = 1; i <= n; i++){
		    System.out.println(max(0, result[i]));
		}
		//System.out.println(result);
	}

}

class Edge {
    int u;
    int v;
    int w;
    
    Edge(int u, int v, int w){
        this.u = u;
        this.v = v;
        this.w = w;
    }
    
    
    public String toString(){
        return "u:" + u + " v:" + v + " w:" + w;
    }
    
}