#Miller-Rabinの素数判定法
def Miller_Rabin_Primality_Test(N,Times=20):
    """Miller-Rabinによる整数Nの素数判定を行う.

    N:整数
    ※:Trueは正確にはProbably Trueである(Falseは確定False).
    """
    from random import randint as ri

    if N==2:
        return True

    if N==1 or N%2==0:
        return False

    q=N-1
    k=0
    while q&1==0:
        k+=1
        q>>=1

    for _ in range(Times):
        m=ri(2,N-1)
        y=pow(m,q,N)
        if y==1:
            continue

        flag=True
        for i in range(k):
            if (y+1)%N==0:
                flag=False
                break

            y*=y
            y%=N

        if flag:
            return False

    return True
#================================================
N=int(input())
Y=[0]*N
for i in range(N):
    x=int(input())
    if Miller_Rabin_Primality_Test(x,100):
        Y[i]="{} {}".format(x,1)
    else:
        Y[i]="{} {}".format(x,0)

print("\n".join(map(str,Y)))