Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

3
1 2 2
2 3 1

Sample Output 1

0
0
1

Sample Input 2

5
2 5 2
2 3 10
1 3 8
3 4 2

Sample Output 2

1
0
1
0
1

Solution in Ruby (2.3.3) (judge verdict: Accepted)

N = gets.to_i
h = Hash.new{|hash, key| hash[key] = []}

(N-1).times do |i|
  u, v, w = gets.split.map(&:to_i)
  h[u] = h[u].push([v,w]) # [繋がっている点 , 辺の長さ]
  h[v] = h[v].push([u,w])
end

ans_tbl = Hash.new(-1)
ans_tbl[1] = 0 # rootを1として考える。1の1からの距離は0
$stack = [[1,0]]

# dfs
loop{
  break if ($stack == [])
    nowp = $stack.pop
    nextp = h[nowp[0]]
    nextp.each{|i|
      n_point,n_len = i[0],i[1]
      if (ans_tbl[n_point] === -1)
        sum_len = nowp[1] + n_len
        ans_tbl[n_point] = sum_len
        $stack.push([n_point,sum_len])
      end
    }
}

N.times do |i|
  puts ans_tbl[i+1] % 2 === 0 ? "0" : "1"
end
# p h
# p ans_tbl