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 u[] = new int[N - 1];
		int v[] = new int[N - 1];
		int w[] = new int[N - 1];
		
		
		LinkedList list[] = new LinkedList[N];
		LinkedList list2[] = new LinkedList[N];
		for(int i = 0; i < N; i++) {
			list[i] = new LinkedList();
			list2[i] = new LinkedList();
		}
		
		for(int i = 0; i < N - 1; i++) {
			u[i] = sc.nextInt() - 1;
			v[i] = sc.nextInt() - 1;
			w[i] = sc.nextInt();
			if(w[i] % 2 == 1) {
				list[u[i]].add(v[i]);
				list[v[i]].add(u[i]);
			} else {
				list2[u[i]].add(v[i]);
				list2[v[i]].add(u[i]);
			}
		}
		int ans[] = new int[N];
		Queue<Integer> queue = new ArrayDeque<Integer>();
		Queue<Integer> queue2 = new ArrayDeque<Integer>();
		ans[0] = 0;
		if(list[0].size() != 0) {
		queue.add(0);
		}
		if(list2[0].size() != 0) {
		queue2.add(0);
		}
		Arrays.fill(ans, -1);
		//for(int k = 0; k < N; k++) {
			/*if(ans[k] == -1 && queue.size() == 0) {
				queue.add(k);
				ans[k] = 1;
			}*/
		while(queue.size() != 0 || queue2.size() != 0) {
			int i = 0;
			
			while(queue.size() != 0) {
				i = queue.poll();
				for(int j = 0; j < list[i].size(); j++) {
					if(ans[i] == 1 && ans[list[i].get(j)] == -1) {
						queue.add(list[i].get(j));
						queue2.add(list[i].get(j));
						ans[list[i].get(j)] = 0;
					} else if(ans[list[i].get(j)] == -1){
						queue.add(list[i].get(j));
						queue2.add(list[i].get(j));
						ans[list[i].get(j)] = 1;
					}
				}
			}
			while(queue2.size() != 0) {
				i = queue2.poll();
				for(int j = 0; j < list2[i].size(); j++) {
					if(ans[i] == 1 && ans[list2[i].get(j)] == -1) {
						queue.add(list2[i].get(j));
						ans[list2[i].get(j)] = 1;
						queue2.add(list2[i].get(j));
					} else if(ans[list2[i].get(j)] == -1){
						queue.add(list2[i].get(j));
						ans[list2[i].get(j)] = 0;
						queue2.add(list2[i].get(j));
					}
				}
			}
		}
		while(queue.size() != 0) {
			int i = queue.poll();
				for(int j = 0; j < list[i].size(); j++) {
					if(ans[i] == 1 && ans[list[i].get(j)] == -1) {
						queue.add(list[i].get(j));
						ans[list[i].get(j)] = 0;
					} else if(ans[list[i].get(j)] == -1){
						queue.add(list[i].get(j));
						ans[list[i].get(j)] = 1;
					}
				}
		}
		//}
		for(int i = 0; i < N; i++) {
			System.out.println(ans[i]);
		}
	}
}


class LinkedList {
	ArrayList<Integer> link = new ArrayList<Integer>();
	public void add(int vertex) {
		link.add(vertex);
	}

	public int get(int i){
		return link.get(i);
	}
	
	public void remove(int vertex) {
	}
	
	public void view() {
		for(int i = 0; i < link.size(); i++) {
			System.out.println(link.get(i));
		}
	}
	
	public boolean linked(int vertex) {
		if(link.contains(vertex)){
			return true;
		} else {
			return false;
		}
	}

	public int size() {
		return link.size();
	}
}