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.util.Map.Entry;

 class Main {
	 static int mod =  (int) (Math.pow(10,9)+7);
    public static void main(String[] args) {
    	
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int[] u = new int[N];
        int[] v = new int[N];
        int[] w = new int[N];
        long[] weight = new long[N];
		ArrayList<HashMap<Integer, Integer>> adj = new ArrayList<HashMap<Integer, Integer>>();
		for(int i = 0; i < N; i++) { adj.add(new HashMap<Integer, Integer>()); }
		for(int i=0;i<N-1;i++) {
            u[i] = sc.nextInt()-1;        	
            v[i] = sc.nextInt()-1;        	
            w[i] = sc.nextInt()%2;
            adj.get(u[i]).put(v[i],w[i]);
            adj.get(v[i]).put(u[i],w[i]);
        }
        
		LinkedList<Integer> queue = new LinkedList<Integer>();
		queue.add(0);
		queue.add(-1);
		queue.add(0);
		int[] answers = new int[N];
		while(!queue.isEmpty()) {
			int node = queue.poll();
			int parent = queue.poll();
			int value = queue.poll();
		
			answers[node] = value;
			for(Entry<Integer, Integer> entry : adj.get(node).entrySet()) {
				int next_node = entry.getKey();
				int next_w = entry.getValue();
				
				if(next_node == parent) { continue; }
				queue.add(next_node); queue.add(node); queue.add((value+next_w)%2);
			}
		}
		
		for(int i=0;i<N;i++) {
	        System.out.println(answers[i]);			
		}
    }
}