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.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Deque;
import java.util.Iterator;
import java.util.Scanner;

// Genericを使った 多分これがよい？
// 実際のソートするときはComparatorで持たせる（下記参照）
class Pair<F, S>{
    public final F first;
    public final S second;

    public Pair (F first, S second) {
        this.first = first;
        this.second = second;
    }
}
class Main{
	public static void main(String args[]){
	    final int INF = Integer.MAX_VALUE/2;
		Scanner sc=new Scanner(System.in);
		int N = sc.nextInt();
		ArrayList<Pair<Integer, Integer>>[] edge = new ArrayList[N];
		for(int i = 0; i < N; i++) {
			edge[i] = new ArrayList<Pair<Integer, Integer>>();
		}
		for(int i = 0; i < N - 1; i++) {
			int u = sc.nextInt();
			int v = sc.nextInt();
			int w = sc.nextInt();
			edge[u - 1].add(new Pair<Integer, Integer>(v - 1, w));
			edge[v - 1].add(new Pair<Integer, Integer>(u - 1, w));
		}
		int[] d = new int[N];
        Arrays.fill(d, -1);
        d[0] = 0;
        Deque<Integer> que = new ArrayDeque<Integer>();
        que.add(0);
        while(!que.isEmpty()){
        	int now = que.pop();
            for(Iterator<Pair<Integer, Integer>> it = edge[now].iterator(); it.hasNext();) {
                Pair<Integer, Integer> next = it.next();
                if(d[next.first] == -1) {
                    d[next.first] = d[now] + next.second;
                    que.add(next.first);
                }
            }
        }

        for(int i = 0;  i < N; i++) {
        	System.out.println((d[i] % 2 == 0) ? 0 : 1);
        }
	}
}