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

/**
 * https://beta.atcoder.jp/contests/abc077/tasks/arc084_b
 */
public class Main {

	static Node nodes[];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		nodes = new Node[N];
		for(int i=0; i<N; i++) {
			nodes[i] = new Node(i);
		}

		for(int i=0; i<N-1; i++){
			Node u = nodes[Integer.parseInt(sc.next()) - 1];
			Node v = nodes[Integer.parseInt(sc.next()) - 1];
			int w = Integer.parseInt(sc.next());
			u.neighbors.put(v.id, w);
			v.neighbors.put(u.id, w);
		}
		sc.close();
		
		nodes[0].ans = 0;
		setAns(nodes[0]);
		
		for(Node n: nodes) {
			System.out.println(n.ans);
		}
		
	}
	
	public static void setAns(Node node){
		for(Entry<Integer, Integer> entry : node.neighbors.entrySet()) {
			Node n = nodes[entry.getKey()]; 
			if (n.ans < 0) {
				if(entry.getValue()%2 == 0) {
					n.ans = node.ans;
				}else {
					n.ans = (node.ans+1)%2;
				}
				setAns(n);
			}
		}
	}
	
	static class Node{
		int id;
		int ans = -1;
		HashMap<Integer, Integer> neighbors = new HashMap<Integer, Integer>();
		Node(int id){
			this.id = id;
		}
	}

}