import random


def judge_miller(n, rep):
    if(n == 1):
        return False
    if(n == 2):
        return True
    if(n % 2 == 0):
        return False
    d = n - 1
    while(d & 1 == 0):
        d >>= 1
    for k in range(rep):
        cp_d = d
        a = random.randint(2, n - 1)
        may_prime = False
        x = pow(a, d, n)
        if(x == 1):
            may_prime = True
        while((not may_prime) and x != n - 1 and d != n - 1):
            if(x == n - 1):
                may_prime = True
            d <<= 1
            x = (x * x) % n
        if(x == n - 1):
            may_prime = True
        if(not may_prime):
            return False
        d = cp_d
    return True


n = int(input())
for i in range(n):
    x = int(input())
    t = x
    res = judge_miller(x, 15)
    if(res):
        print(str(t) + " 1")
    else:
        print(str(t) + " 0")