#include "bits/stdc++.h"
using namespace std;
#define int unsigned long long
random_device rd;
mt19937 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);
}
long long xqrl(int a, int n) {
	int res = 1;
	a %= n;
	if (a ==n-1)return pow(-1,(n - 1) >> 1);
	if (a == 2) {
		int k = n % 8;
		return pow(-1, (k*k - 1) / 8);
	}
	if (!(a & 1))return xqrl(2, n)*xqrl(a / 2, n);
	int A = (a - 1) % 16, N = (n - 1) % 16;
	return pow(-1, A*N / 4)*xqrl(n, a);

}
bool isprime(int p) {
	if (p == 2 || p == 3 || p == 5)return true;
	if (p == 1 || p == 4)return false;
	for(int z=0;z<11;++z) {
		int b = mt() % (p - 2) + 2;
		if (gcd(b, p) > 1) {
			return false;
		}
		
		if (modpow(b, (p - 1)>>1, p) !=(xqrl(b,p)+p)%p) {
			return false;
		}
	}
	return true;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

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

	}
}