#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

LLI power(LLI n, LLI p, LLI m){
  LLI ret = 1;
  while(p>0){
    if(p&1) (ret *= n) %= m;
    (n *= n) %= m;
    p /= 2;
  }
  return ret;
}



class MillerRabin{
  static bool check(int64_t n, int64_t d, int64_t s, int64_t a){
    if(power(a,d,n) == 1) return true;

    for(int64_t r = 0; r <= s-1; ++r){
      if(power(a,d<<r,n) == n-1) return true;
    }

    return false;
  }

public:
  static bool is_prime(int64_t n){
    if(n == 1) return false;
    if(n == 2) return true;
    if(n%2 == 0) return false;

    static mt19937 rand(time(0));
    
    int64_t s = 0, d = n-1;

    while(d%2 == 0){
      d /= 2;
      ++s;
    }

    REP(i,100){
      int64_t a = rand() % (n-1) + 1;
      if(not check(n,d,s,a)) return false;
    }
    
    return true;
  }
};



int main(){
  int N; cin >> N;
  REP(i,N){
    int64_t x; cin >> x;
    cout << x << " " << MillerRabin::is_prime(x) << endl;
  }

  return 0;
}