#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
std::vector<bool> sieveOfEratosthenes(long long  n = 1000000) {
	std::vector<bool>p(n + 1, true);
	std::vector<long long>ret;
	p[0] = false;
	p[1] = false;
	for (int i = 2; i <= n; ++i) {
		if (!p[i]) continue;
		ret.push_back(i);
		for (int j = 2 * i; j <= n; j += i) p[j] = false;
	}
	return p;
}
//long long にしているのは p*pとかでこまらないように
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	auto plist = sieveOfEratosthenes(3000006);
	vector<int>rui(3000006);
	rep2(i, 1, 3000006) {
		if (plist[i])rui[i]++;
		rui[i] += rui[i - 1];
	}
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		// 素数->後手Win
		// その他
		// n-1までの合成数と
		// n/2までの素数すべてが選択される
		if (plist[n]) {
			cout << "P" << endl;
			continue;
		}
		int f = rui[n] - rui[n / 2];
		int m = n - f - 2;
		cout << (0 == m % 2 ? "P" : "K") << endl;
	}
	return 0;
}