#include <bits/stdc++.h>
using namespace std;
using ll = long long;


int main(void) {
	int t;	cin >> t;
	vector<int> query(t);
	int m = 0;
	for (int i = 0; i < t; i++) {
		cin >> query[i];
		if (m < query[i]) {
			m = query[i];
		}
	}

	vector<bool> is_prime(m + 1, true);
	is_prime[0] = is_prime[1] = false;
	for (int i = 2; i <= m; i++) {
		if (is_prime[i] == false) {
			continue;
		}
		for (int j = i << 1; j <= m; j += i) {
			is_prime[j] = false;
		}
	}

	vector<int> dp1(m + 1), dp2(m + 1);
	vector<char> ans(m + 1);
	for (int n = 2; n <= m; n++) {
		dp1[n] = dp1[n - 1];
		dp2[n] += dp2[n - 1];
		if (is_prime[n]) {
			dp1[n]++;
			int k = n << 1;
			if (k <= m) {
				dp2[k]++;
			}
			ans[n] = 'P';
			continue;
		}
		ans[n] = ((n - dp1[n] + dp2[n]) & 1) ? 'K' : 'P';
	}

	for (int n : query) {
		cout << ans[n] << endl;
	}

	return 0;
}