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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		List<List<Hen>> list = new ArrayList<List<Hen>>();
		for (int i = 0; i < n; i++) {
			list.add(new ArrayList<Hen>());
		}
		for (int i = 0; i < n - 1; i++) {
			sa = br.readLine().split(" ");
			Hen h = new Hen();
			h.u = Integer.parseInt(sa[0]) - 1;
			h.v = Integer.parseInt(sa[1]) - 1;
			h.w = Integer.parseInt(sa[2]);
			list.get(h.u).add(h);
			list.get(h.v).add(h);
		}
		br.close();

		boolean[] flg = new boolean[n];
		int[] ans = new int[n];
		Queue<Integer> que = new ArrayDeque<Integer>();
		que.add(0);
		flg[0] = true;
		while (!que.isEmpty()) {
			int cur = que.poll();
			List<Hen> list2 = list.get(cur);
			for (int i = 0; i < list2.size(); i++) {
				Hen h = list2.get(i);
				int next = h.u;
				if (next == cur) {
					next = h.v;
				}
				if (!flg[next]) {
					que.add(next);
					flg[next] = true;
					if (h.w % 2 == 0) {
						ans[next] = ans[cur];
					} else {
						ans[next] = ans[cur]^ 1;
					}
				}
			}
		}

		for (int i = 0; i < ans.length; i++) {
			System.out.println(ans[i]);
		}
	}

	static class Hen {
		int u, v, w;
	}
}