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.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;

public class Main {
    private static Scanner sc;
    public static void main(String[] args) {
        Main instance = new Main();
        sc = instance.new Scanner();
        instance.solve();
    }

    class Edge {
        int next;
        long weight;
        Edge (int n, long w) {
            next = n;
            weight = w;
        }
    }


    int n;

    private void solve() {
        try {
            n = sc.nextInt();
            byte[] visited = new byte[100001];
            List<List<Edge>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            int v;
            int u = 0;
            long w;
            int first = 0;
            for (int i = 0; i < n -1; i++) {
                u = sc.nextInt();
                v = sc.nextInt();
                w = sc.nextLong();
                Edge tmp = new Edge(v, w);
                Edge tmp2 = new Edge(u, w);
                graph.get(u).add(tmp);
                graph.get(v).add(tmp2);
            }

            for (int i = 1; i <= n; i++) {
                if (graph.get(i).size() == 1) {
                    u = i;
                }
            }

            Queue<Integer> q = new ArrayDeque<>();
            q.add(u);
            visited[u] = 1;
            while (!q.isEmpty()) {
                u = q.poll();
                for (int i = 0; i < graph.get(u).size(); i++) {
                    int vv = graph.get(u).get(i).next;
                    long ww = graph.get(u).get(i).weight;
                    if (visited[vv] == 0) {
                        q.add(vv);
                        if (visited[u] == 2) {
                            if (ww%2 == 1) visited[vv] = 1;
                            else visited[vv] = 2;
                        } else {
                            if (ww%2 == 1) visited[vv] = 2;
                            else visited[vv] = 1;
                        }
                    }
                }
            }

            for (int i = 1; i <= n; i++) {
                System.out.println(visited[i]%2);
            }

        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    private class Scanner {
        String[] s;
        int i;
        BufferedReader br;
        String regex = " ";

        public Scanner() {
            s = new String[0];
            i = 0;
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        @Override
        protected void finalize() throws Throwable {
            try {
                super.finalize();
            } finally {
                destruction();
            }
        }

        private void destruction() throws IOException {
            if (br != null) br.close();
        }

        public String next() throws IOException {
            if (i < s.length) return s[i++];
            String st = br.readLine();
            while (st == "") st = br.readLine();
            s = st.split(regex, 0);
            i = 0;
            return s[i++];
        }

        public int nextInt() throws NumberFormatException, IOException {
            return Integer.parseInt(next());
        }

        public Long nextLong() throws NumberFormatException, IOException {
            return Long.parseLong(next());
        }

        public Double nextDouble() throws NumberFormatException, IOException {
            return Double.parseDouble(next());
        }
    }
}