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.IOException;
import java.io.InputStreamReader;
import java.nio.charset.StandardCharsets;
import java.util.*;

public class Main {
	Map<Integer, Long>[] tree;
	boolean[] result;

	Main(int N, List<String> lines) {
		this.tree = new Map[N];
		this.result = new boolean[N];
		Arrays.fill(this.result, true);
		for (int i = 0; i < N; ++i) {
			this.tree[i] = new HashMap<>();
		}
		for (String line : lines) {
			String[] tokens = line.split(" ");
			int u = Integer.parseInt(tokens[0]);
			int v = Integer.parseInt(tokens[1]);
			long w = Long.parseLong(tokens[2]);
			this.tree[u - 1].put(v - 1, w);
			this.tree[v - 1].put(u - 1, w);
		}
		calc(0);
	}

	void calc(int nodeIndex) {
		boolean color = result[nodeIndex];
		for (Integer key : this.tree[nodeIndex].keySet()) {
			long w = this.tree[nodeIndex].get(key);
			if (w % 2 == 0) {
				this.result[key] = color;
			} else {
				this.result[key] = !color;
			}
			this.tree[key].remove(nodeIndex);
			calc(key);
		}
	}

	void show() {
		for (int i = 0; i < result.length; ++i) {
			if (result[i]) {
				System.out.println("1");
			} else {
				System.out.println("0");
			}
		}
	}

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		int N = Integer.parseInt(in.readLine());
		List<String> lines = new ArrayList<>(N);
		for (int i = 0; i < N - 1; ++i) {
			lines.add(in.readLine());
		}
		in.close();
		Main ins = new Main(N, lines);
		ins.show();
	}
}