#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> 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<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &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<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

bool isprime(ll n)
{
  if (n == 1)
    return false;
  const vector<ll> as = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  const vector<ll> ps = {2, 3, 5, 13, 19, 73, 193, 405721, 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 % 2 == 0)
    d /= 2, s++;

  for (auto a : as)
  {
    ll a0 = 1;
    for (ll d2 = d, tmp = a; d2 > 0; d2 /= 2, tmp = __int128_t(tmp) * tmp % n)
    {
      if (d2 % 2 == 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';
  }
}