from math import gcd def isprime(n): if n <= 2: return n == 2 if n % 2 == 0: return False s = 0 t = n - 1 while t % 2 == 0: s += 1 t //= 2 for a in [2,325,9375,28178,450775,9780504,1795265022]: if a >= n: break x = pow(a, t, n) if x == 1 or x == n - 1: continue for _ in range(s): x = (x * x) % n if x == n - 1: break if x == n - 1: continue return False return True def Pollad(N): if N % 2 == 0: return 2 if isprime(N): return N def f(x): return (x * x + 1) % N step = 0 while True: step += 1 x = step y = f(x) while True: p = gcd(y - x + N, N) if p == 0 or p == N: break if p != 1: return p x = f(x) y = f(f(y)) def Primefact(N): if N == 1: return [] q = [] q.append(N) ret = [] while q: now = q.pop() if now == 1: continue p = Pollad(now) if p == now: ret.append(p) else: q.append(p) q.append(now // p) return ret import sys from collections import deque, Counter sys.setrecursionlimit(5 * 10 ** 5) from pypyjit import set_param set_param('max_unroll_recursion=-1') input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 n = ii() for _ in range(n): x = ii() print(x, int(isprime(x)))