#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int challenge = 100;

ll powmod(ll a, ll x, ll p){
    ll res=1;
    while(x>0){
        if(x%2 == 1){
            res = (res * a) % p;
            x--;
        }
        a = (a*a)%p;
        x >>= 1;
    }
    return res;
}

bool is_prime(ll n){
    if(n == 2) return(true);
    if(n == 1 || (n&1) == 0) return (false);
    
    mt19937 mt;
    ll s=1;
    ll d=n;
    do{
        d >>= 1;
    }while((d&1) == 0);

    for(int i=0;i<challenge;i++){
        ll a = 1 + mt() % (n-1);
        ll t = d;
        ll y = powmod(a,t,n);
        while(t != n-1 && y != 1 && y != n-1){
            y = powmod(y,2,n);
            t <<= 1;
        }
        if(y != n-1 && (t&1) == 0) return false;
    }
    
    return(true);
}

int main() {
    int n;
    cin >> n;
    vector<ll> x(n);
    for(int i=0;i<n;i++){
        cin >> x[i];
    }

    for(int i=0;i<n;i++){
        cout << x[i] << " ";
        if(is_prime(x[i])){
            cout << 1 << endl;
        }else{
            cout << 0 << endl;
        }
    }

    return(0);
}