class Integer
  def divisor_list
    require 'prime'

    return [] if self <= 0
    return [1] if self == 1

    prime_division.map.with_index { |(base, k), i|
      s = i.zero? ? 0 : 1
      (s..k).map { |n| base ** n }
    }.inject { |res, e| res + res.flat_map { |t| e.map { |v| t * v } } }.sort
  end
end

T = gets.to_i

T.times do
  n = gets.to_i

  if [1, 3, 4, 5, 7, 8].include?(n)
    puts 1
  else
    puts 2
  end
end