#include using namespace std; #include using namespace atcoder; using mint = modint998244353; //using mint = modint1000000007; using ll = long long; using ld = long double; using pll = pair; using tlll = tuple; constexpr ll INF = 1LL << 60; template bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll safemod(ll A, ll M) {return (A % M + M) % M;} ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;} ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);} template void unique(vector &V) {V.erase(unique(V.begin(), V.end()), V.end());} template void sortunique(vector &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) template void printvec(const vector &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';} template void printvect(const vector &V) {for (auto v : V) cout << v << '\n';} template void printvec2(const vector> &V) {for (auto &v : V) printvec(v);} bool isprime(ll n) { if (n == 1) return false; const vector as = {2, 325, 9375, 28178, 450775, 9780504, 1795265022}; const vector ps = {2, 3, 5, 13, 19, 73, 193, 407521, 299210837}; for (auto p : ps) { if (n == p) return true; if (n % p == 0) return false; } ll d = n - 1; int s = 0; while (!(d & 1)) d >>= 1, s++; for (auto a : as) { ll a0 = 1; for (ll d2 = d, tmp = a; d2 > 0; d2 >>= 1, tmp = __int128_t(tmp) * tmp % n) { if (d2 & 1) a0 = __int128_t(a0) * tmp % n; } if (a0 == 1 || a0 == n - 1) continue; for (int r = 1; r <= s; r++) { if (r == s) return false; a0 = __int128_t(a0) * a0 % n; if (a0 == n - 1) break; } } return true; } int main() { ll T; cin >> T; for (ll t = 0; t < T; t++) { ll x; cin >> x; cout << x << " " << isprime(x) << '\n'; } }