def is_prime(x) -> bool:
    if x == 2:
        return True
    if x < 2 or (x & 1) == 0:
        return False
    for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:
        if a % x == 0:
            continue
        d = x - 1
        s = 0
        while (d & 1) == 0:
            d >>= 1
            s += 1
        t = pow(a, d, x)
        if t == 1:
            continue
        for _ in range(s):
            if t == x - 1:
                break
            t = pow(t, 2, x)
        else:
            return False
    return True
for i in range(int(input())):
    x = int(input())
    print(x, 1 if is_prime(x) else 0)