#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 modpow(ll b, ll e, ll m) {
	ll result = 1;
	while (e > 0) {
		if ((e & 1) == 1) {
			result = (result * b) % m;
		}
		e /= 2;
		b = (b * b) % m;
	}
	return result;
}


bool millerRabinPrimalityTest(ll p) {
	if (p == 1) {
		return false;
	} else if (p == 2) {
		return true;
	} else if (p % 2 == 0) {
		return false;
	}

	ll d = p - 1;
	while (d % 2 == 0) {
		d /= 2;
	}

	ll k = 50;
	for (ll i = 0; i != k; i++) {
		ll a = rand() % (p - 2LL) + 1LL;
		ll y = modpow(a, d, p);
		ll t = d;
		while (t != p - 1 && y != 1 && y != p - 1) {
			y = modpow(y, 2, p);
			t *= 2LL;
		}

		if (y != p - 1 && t % 2 == 0) {
			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 << " " << millerRabinPrimalityTest(x) << endl;
	}
	return 0;
}