def miller_rabin(n, check):
  d, s = n - 1, 0
  while d % 2 == 0:
    d >>= 1
    s += 1
  for a in check:
    if n <= a:
      return True
    a = pow(a, d, n)
    if a == 1:
      continue
    r = 1
    while a != n - 1:
      if r == s:
        return False
      a = a * a % n
      r += 1
  return True

def is_prime32(n):
  miller_rabin(n, [2, 7, 61])
def is_prime64(n):
  miller_rabin(n, [2, 3, 5, 7, 325, 9375, 28178, 450775, 9780504, 1795265022])


def is_prime(n):
  if n <= 1:
    return False
  if n <= 3:
    return True
  if n % 2 == 0:
    return False
  if n < 4759123141:
    return is_prime32(n)
  if n < 18446744073709551615:
    return is_prime64(n)

for i in range(int(input())):
  x = int(input())
  print(x, int(is_prime(x)))