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.HashMap;
import java.util.Map;


public class Main {

	public static void main(String[] args) {
		try {
			BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
			int n = Integer.parseInt(bf.readLine());

			// 各頂点につながっている頂点・距離をまとめる
			Map<Integer, Map<Integer, Integer>> connectMap = new HashMap<Integer, Map<Integer, Integer>>();
			for (int i = 1; i < n; i++) {
				String[] input = bf.readLine().split(" ");
				int from = Integer.parseInt(input[0]);
				int to = Integer.parseInt(input[1]);
				int range = Integer.parseInt(input[2]);

				if (!connectMap.containsKey(from)) {
					connectMap.put(from, new HashMap<Integer, Integer>());
				}
				connectMap.get(from).put(to, range);
				if (!connectMap.containsKey(to)) {
					connectMap.put(to, new HashMap<Integer, Integer>());
				}
				connectMap.get(to).put(from, range);
			}
			bf.close();

			// 頂点番号1を基準に、そこからの距離が偶数なら同色、違ったら異色に塗り替えていく
			int start = 1;
			int[] colors = new int[n + 1];
			colors[start] = 1;
			for (Integer next : connectMap.get(start).keySet()) {
				changeColor(start, next, connectMap, colors);
			}

			// 出力
			for (int i = 1; i < colors.length; i++) {
				System.out.println(colors[i]);
			}
		} catch (Exception e) {
		}
	}

	private static void changeColor(int from, int curr, Map<Integer, Map<Integer, Integer>> connectMap, int[] colors) {

		// 距離が偶数なら前の頂点と同じ色、奇数なら違う色（0→1 or 1→0）
		int range = connectMap.get(from).get(curr);
		colors[curr] = (range % 2 == 0 ? colors[from] : Math.abs(colors[from] - 1));

		// 現在の頂点につながっているほかの頂点にも同じことを繰り返す
		for (Integer next : connectMap.get(curr).keySet()) {
			if (next == from) {
				continue;
			}
			changeColor(curr, next, connectMap, colors);
		}
	}
}