#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

using cll = __int128_t;
cll mod_exp(cll b, cll e, cll m){
    if (e > 0 && b == 0) return 0;
    cll ans = 1 % m;
    b %= m;

    while (e > 0){
        if (e & 1) ans = (ans * b) % m;
        e >>= 1;
        b = (b*b) % m;
    }

    return ans;
}

bool _miller_rabin(ll N, vector<ll> A){
    ll s = 0, t = N-1;
    while(!(t & 1)){
        s++;
        t >>= 1;
    }
    for (auto a : A){
        if (N <= a) return 1;
        ll x = mod_exp(a, t, N);
        if (x == 1) continue;
        bool f=0;
        for (int r=0; r<s; r++){
            if (x == N-1){
                f = 1;
                break;
            }
            x = (cll)x * x % N;
        }
        if (!f) return 0;
    }
    return 1;
}

bool miller_rabin(ll N){
    if (N == 2) return 1;
    if (N <= 1) return 0;
    if (N % 2 == 0) return 0;
    if (N < 4759123141LL) return _miller_rabin(N, {2, 7, 61});
    return _miller_rabin(N, {2, 325, 9375, 28178, 450775, 9780504, 1795265022});
}


int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    ll N, x;
    cin >> N;
    while(N--){
        cin >> x;
        cout << x << " " << miller_rabin(x) << endl;
    }

    return 0;
}