#include <bits/stdc++.h>
using namespace std;

class MillerRabin {
    __int128_t mod_pow(__int128_t a, long long n, long long m) {
        a %= m;
        __int128_t res = 1;
        while (n) {
            if (n & 1) (res *= a) %= m;
            (a *= a) %= m;
            n >>= 1;
        }
        return res;
    }

public:
    mt19937_64 mt;

    MillerRabin() {
        mt.seed(chrono::steady_clock::now().time_since_epoch().count());
    }

    bool is_prime(long long n, int k = 20) {
        if (n == 2) return true;
        if (n < 2 || !(n & 1)) return false;
        uniform_int_distribution<long long> dist(1, n - 1);
        long long d = n - 1;
        while (!(d & 1)) d >>= 1;
        for (int i = 0; i < k; ++i) {
            long long a = dist(mt), t = d, y = mod_pow(a, t, n);
            while (t != n - 1 && y != 1 && y != n - 1) {
                y = mod_pow(y, 2, n);
                t <<= 1;
            }
            if (y != n - 1 && !(t & 1)) return false;
        }
        return true;
    }
};

int main() {
    int n;
    cin >> n;
    MillerRabin mr;
    for (int i = 0; i < n; ++i) {
        long long x;
        cin >> x;
        cout << x << " " << mr.is_prime(x) << endl;
    }
}