def isprime(N):
    bases = [2,325,9375,28178,450775,9780504,1795265022]
    if N < 2:
        return False
    if N == 2:
        return True
    if N%2 == 0:
        return False
    s,t = (N & -N).bit_length()-1,N//(N & -N)
    for b in bases:
        if b % N == 0:
            continue
        t = pow(b,N-1,N)
        if t == 1 or t == N-1:
            continue
        for _ in range(s-1):
            t = pow(t,2,N)
            if t == N-1:
                break
        else:
            return False
    return True
N = int(input())
for i in range(N):
    X =int(input())
    if isprime(X):
        print(X,1)
    else:
        print(X,0)