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 main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] d = new int[N];
		Arrays.fill(d, -1);
		Map<Integer, Map<Integer, Integer>> l = new HashMap<>();
		Map<Integer, List<Integer>> m = new HashMap<>();
		for(int i = 0; i < N; i++) {
			m.put(i, new ArrayList<>());
			l.put(i, new HashMap<Integer, Integer>());
		}
		for(int i = 0; i < N-1; i++) {
			int u = sc.nextInt()-1;
			int v = sc.nextInt()-1;
			int w = sc.nextInt() % 2;
			m.get(u).add(v);
			m.get(v).add(u);
			l.get(u).put(v, w);
			l.get(v).put(u, w);
		}
		d[0] = 0;
		Deque<Integer> q = new ArrayDeque<>();
		q.add(0);
		while(q.size() > 0) {
			int r = q.pollFirst();
			for(int p : m.get(r)) {
				if(d[p] != -1)
					continue;
				d[p] = d[r] + l.get(r).get(p);
				q.offerFirst(p);
			}
		}
		for(int i = 0; i < N; i++) {
			if(d[i] % 2 == 0)
				System.out.println(0);
			else
				System.out.println(1);
		}
	}

}