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


public class Main {
    static long mod = 1000000000+7;
    static int n,a,b,k;
    static HashMap<Integer,Integer>[] g;
    static int[] ans;
    public static void main(String[] args) throws Exception{
        //Scanner sc = new Scanner(System.in);
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] buf = reader.readLine().split(" ");
        n = Integer.parseInt(buf[0]);
        ans = new int[n+1];
        g = new HashMap[n+1];
        for(int i=0;i<=n;i++) g[i]=new HashMap<>();
        for(int i=0;i<n-1;i++){
            buf = reader.readLine().split(" ");
            int u = Integer.parseInt(buf[0]), v = Integer.parseInt(buf[1]);
            int len = Integer.parseInt(buf[2]);
            g[u].put(v,len); g[v].put(u,len);
        }
        ans[1]=1;
        for(int w:g[1].keySet()) dfs(w,1);
        PrintWriter out = new PrintWriter(System.out);
        for(int i=1;i<=n;i++) out.println(ans[i]);
        out.flush();
    }
    static void dfs(int cur, int from){
        int len = g[cur].get(from);
        if(len%2==0) ans[cur]=ans[from];
        else ans[cur] = 1-ans[from];
        for(int w:g[cur].keySet()){
            if(w==from) continue;
            dfs(w,cur);
        }
    }
}