#include <bits/stdc++.h>
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define along long(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(along long(v)),v.erase(unique(along long(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

//動作はint型のみ保証
//long long型の二乗とかが怪しい(__int128使ったらいける)
// const vector<int> numset = {2,7,61}; // < 4,759,123,141 ≒ 4×10^9
// const vector<int> numset = {2,3,5,7,11,13,17}; // < 341,550,071,728,321 ≒　3*10^14
const vector<int> numset = {2,3,5,7,11,13,17,19,23,29,31,37}; // 2^64までいける
// long long mod_pow(long long x, long long k, long long mod){
//     long long res = 1;
//     while(k){
//         if(k & 1) res = res * x % mod;
//         x = x * x % mod;
//         k >>= 1;
//     }
//     return res;
// }
// long long型の素数判定の場合
long long mod_pow(__int128 x, long long k, long long mod){
    __int128 res = 1;
    while(k){
        if(k & 1) res = res * x % mod;
        x = x * x % mod;
        k >>= 1;
    }
    return res;
}
// check if n is prime
bool check(long long n){
    if(n < 2) return false;
    long long d = n - 1, s = 0;
    while(d % 2 == 0){
        d /= 2;
        s++;
    }
    for(int a : numset){
        if(a == n) return true;
        long long res = mod_pow(a, d, n);
        if(res != 1){
            bool ok = true;
            for(int r = 0; r < s; r++){
                if(mod_pow(res, 1LL << r, n) == n-1){
                    ok = false;
                    break;
                }
            }
            if(ok) return false;
        }
    }
    return true;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    rep(i,n){
        long long x;
        cin >> x;
        cout << x << " " << check(x) << "\n";
    }
    return 0;
}