#include <bits/stdc++.h>
using namespace std;

bool is_SPRP(uint64_t n, uint32_t a) {
  uint64_t d = n - 1, s = 0;
  while ((d & 1) == 0) {
    ++s;
    d >>= 1;
  }
  __uint128_t cur = 1, pw = d;
  while (pw) {
    if (pw & 1) {
      cur = (cur * a) % n;
    }
    a = ((__uint128_t)a * a) % n;
    pw >>= 1;
  }
  if (cur == 1) {
    return true;
  }
  for (uint64_t r = 0; r < s; r++) {
    if (cur == n - 1) {
      return true;
    }
    cur = (cur * cur) % n;
  }
  return false;
}

bool is_prime(uint64_t x) {
  if (x <= 1) return false;
  if (x < 1ULL << 32) {
    const vector<uint32_t> bases{2, 7, 61};
    for (const uint32_t base : bases) {
      if (x != base && !is_SPRP(x, base)) return false;
    }
  } else {
    const vector<uint64_t> bases{2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    for (const uint64_t base : bases) {
      if (x != base && !is_SPRP(x, base)) return false;
    }
  }

  return true;
}

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

  while (q--) {
    uint64_t n;
    cin >> n;

    cout << n << " " << is_prime(n) << endl;
  }
}