//g++ 6.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)

#include <initializer_list>

bool is_prime(long long x){
  using u128=__uint128_t;
  
  if(x==2||x==3||x==5||x==7)return true;
  if(x%2==0||x%3==0||x%5==0||x%7==0)return false;
  if(x<121){
    return x>1;
  }

  long long d = (x-1) >> __builtin_ctzll(x-1);
  long long one=1,minus_one=x-1;

  auto pow = [](long long x,long long n,long long mod){
    long long res;
    x%=mod;
    if(n==0){
      res=1;return res;
    }
    res=1;
    long long now=x;
    for(;n;n>>=1,now=(static_cast<__int128>(now)*now)%mod){
      if(n&1){
        res=static_cast<__int128>(res)*now%mod;
      }
    }
    return res;
  };

  auto ok = [&](long long a){
    auto y=pow(a,d,x);
    long long t=d;

    while(y!=one&&y!=minus_one&&t!=x-1){
      y=static_cast<__int128>(y)*y%x;
      t<<=1;
    }

    if(y!=minus_one&&t%2==0)return false;
    return true;
  };

  if(x<(1ull<<32)){
    for(const long long a:{2,7,61}){
      if(!ok(a))return false;
    }
  }
  else{
    for(const long long a:{2,325,9375,28178,450775,9780504,1795265022}){
      if(x<=a)return true;
      if(!ok(a))return false;
    }
  }

  return true;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int t;
  cin>>t;
  
  while(t--){
    ll x;
    cin>>x;
    cout<<x<<" "<<is_prime(x)<<"\n";
  }
}