#include "bits/stdc++.h"
using namespace std;
#define int unsigned long long
random_device rd;
mt19937_64 mt(rd());
int modpro(int x, int n, int md) {//log^2 n
	int res = 0;
	for (; n; n >>= 1) {
		if (n & 1)res =(res+x)%md; x = (x + x) % md;
	}
	return res;
}
int modpow(int x, int n, int md) {//log n
	int res = 1;
	for (; n; n >>= 1) {
		if (n & 1)res = modpro(res, x, md);
		x = modpro(x, x, md);
	}
	return res;
}

int gcd(int a, int b) {
	if (!b)return a; return gcd(b, a%b);
}

bool isprime(int n) {
	if (n < 2)return false;

	int m = n - 1;
	int e = 0;
	while (!(m & 1)) {
		m /= 2; e++;
	}
	for(int z=0;z<7;z++) {
		int b = mt() % (n-1)+1;
		if (gcd(b, n) != 1)return false;
		bool ok = false;
		if (modpow(b, m, n) != 1) {
			for (int k = 0; k < e; k++) {
				if (modpow(b, m*(1ll << k), n) == n - 1) {
					ok = true; break;
				}
			}
		}
		else ok = true;
		if (!ok) {
			return false;
		}
	}
	return true;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	signed n; cin >> n;
	int p;
	for (int i = 0; i < n; i++) {
		cin >> p;
		cout << p;
		if (isprime(p))cout << " 1" << endl;
		else cout << " 0" << endl;
	}
}