#include "bits/stdc++.h"

using namespace std;

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

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dx[] = { -1, 0, 1, 0 };
const int dy[] = { 0, 1, 0, -1 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

ll mulmod(ll a, ll b, ll mod) {
	ll x = 0, y = a % mod;
	while (b > 0) {
		if (b & 1) {
			x = (x + y) % mod;
		}

		y = (2 * y) % mod;
		b /= 2;
	}

	return x % mod;
}

ll modulo(ll base, ll exponent, ll mod) {
	ll x = 1;
	ll y = base;
	while (exponent > 0) {
		if (exponent & 1) {
			x = (x * y) % mod;
		}

		y = (y * y) % mod;
		exponent = exponent / 2;
	}

	return x % mod;
}

bool miller(ll p, int loopNum = 50) {
	if (p < 2 || (p != 2 && !(p & 1))) {
		return false;
	}

	ll s = p - 1;
	while (!(s & 1)) {
		s /= 2;
	}

	for (int i = 0; i < loopNum; i++) {
		ll a = rand() % (p - 1) + 1;
		ll t = s;
		ll mod = modulo(a, t, p);
		while (t != p - 1 && mod != 1 && mod != p - 1) {
			mod = mulmod(mod, mod, p);
			t *= 2;
		}
		if (mod != p - 1 && !(t & 1)) {
			return false;
		}
	}

	return true;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {
		ll x;
		cin >> x;
		cout << x << " " << miller(x) << endl;
	}

	return 0;
}