def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0:
        return False
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
    for a in bases:
        if a >= n:
            continue
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True

import sys

def main():
    input = sys.stdin.read().split()
    n = int(input[0])
    for i in range(1, n+1):
        x = int(input[i])
        if is_prime(x):
            print(f"{x} 1")
        else:
            print(f"{x} 0")

if __name__ == "__main__":
    main()