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: Runtime Error)

N = gets.to_i

nodes = []

n_c = []


(N-1).times do |i|
  u, v, w = gets.split.map(&:to_i)

  if (u < v)

      nodes[u] = {} if (nodes[u].nil?)
      nodes[u][v] = w

  else

      nodes[v] = {} if (nodes[v].nil?)
      nodes[v][u] = w

  end



end

first = true

nodes.length.times do |i|
  
  next if nodes[i] == nil 

  if first
    n_c[i] = 1 
    first = false
  end




#  p nodes

  nodes[i].each do |k , v|

   # p k
   # p "=>"
   # p v

    #next if n_c[i] == nil

    if v%2 == 0
      n_c[k] = n_c[i]
    else
      n_c[k] = n_c[i] * -1
    end

  end
    

end


#p n_c

n_c.length.times do |i|
  next if i == 0

  if n_c[i] == 1
    puts 1
  else
    puts 0
  end


end

#puts ans