#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cassert>
#include <cstring>
#include <random>

using namespace std;

mt19937 mt(123456);

using u128 = __uint128_t;

bool miller_rabin(unsigned long long n) {
  if (n <= 1) return false;
  if (n == 2) return true;

  unsigned long long s = n - 1;
  int e = 0;
  for (; s % 2 == 0; s /= 2) e++;
  // n-1 = s 2^e

  auto mul = [&](unsigned long long a, unsigned long long b, unsigned long long m) {
    return u128(a) * b % m;
  };

  for (int ii = 0; ii < 8; ii++) {
    unsigned long long x = std::uniform_int_distribution<unsigned long long>(2, n - 1)(mt);
    unsigned long long r = 1;
    for (unsigned long long i = s; i > 0; i >>= 1) {
      if (i & 1) r = mul(r, x, n);
      x = mul(x, x, n);
    }
    if (r == 1 || r == n - 1) continue;
    for (int i = 0; i < e - 1; i++) {
      r = mul(r, r, n);
      if (r == n - 1) break;
    }
    if (r != n - 1) return false;
  }

  return true;
}

bool is_prime(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return n != 1;
}

int main() {
  int n;
  cin >> n;

  while (n--) {
    long long x;
    scanf("%lld", &x);
    printf("%lld %d\n", x, miller_rabin(x));
  }
}