def miller_rabin(n):
    if n == 2:
        return True
    if n == 1 or n % 2 == 0:
        return False

    s = 0
    d = n - 1
    while d & 1 == 0:
        s += 1
        d >>= 1
    for a in (2, 3, 5, 7, 11, 13, 17, 19, 23):
        if n <= a:
            break
        x = pow(a, d, n)
        if x == 1:
            continue
        for _ in range(s):
            if x == n - 1:
                break
            x = x * x % n
        else:
            return False

    return True


n = int(input())
x = [int(input()) for i in range(n)]

for val in x:
    print(val, int(miller_rabin(val)))