class Disjoint_set
  attr_accessor :next, :me, :rank
  def initialize(n,m)
    @next = n
    @me = m
    @rank = 0
  end
  def find_set(x)
    temp = x
    if x != $ps[x].next
      temp = $ps[$ps[x].next].find_set($ps[x].next)
    end
    return temp
  end
  def print_all()
    puts "next:#{@next}"
    puts "me:#{@me}"
    puts "rank:#{@rank}"
    puts
  end
end
def union(xroot, yroot)
  if $ps[xroot].rank < $ps[yroot].rank
    $ps[yroot].next = xroot
  else
    $ps[xroot].next = yroot
    if $ps[xroot].rank == $ps[yroot].rank
      $ps[yroot].rank+=1
    end
  end
end
$ps = []
n,q = gets.split.map(&:to_i)
n.times{|i|
  $ps << Disjoint_set.new(i,i)
}
q.times{|i|
  com, x, y = gets.split.map(&:to_i)

  xroot = $ps[x].find_set(x)
  yroot = $ps[y].find_set(y)

  if com == 0
    if xroot != yroot
      union(x, y)
    end
#    $ps[x].print_all
#    $ps[y].print_all
  else
#    puts "xroot:#{xroot}"
#    puts "yroot:#{yroot}"

    if xroot == yroot
      puts "1"
    else
      puts "0"
    end
  end
}

