{"raw_statement":[{"iden":"problem statement","content":"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:\n\n*   For any two vertices painted in the same color, the distance between them is an even number.\n\nFind 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."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq u_i < v_i \\leq N$\n*   $1 \\leq w_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$u_1$ $v_1$ $w_1$\n$u_2$ $v_2$ $w_2$\n$.$\n$.$\n$.$\n$u_{N - 1}$ $v_{N - 1}$ $w_{N - 1}$"},{"iden":"sample input 1","content":"3\n1 2 2\n2 3 1"},{"iden":"sample output 1","content":"0\n0\n1"},{"iden":"sample input 2","content":"5\n2 5 2\n2 3 10\n1 3 8\n3 4 2"},{"iden":"sample output 2","content":"1\n0\n1\n0\n1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}