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

ll gcd(ll a, ll b) {
	while (b != 0) {
		ll r = a % b;
		a = b;
		b = r;
	}
	return a;
}

void solve(ll n) {
	for (ll i = 2; i < n; i++) {
		if (n % i == 0) {
			continue;
		}
		if (gcd(n, i) == 1) {
			cout << 'K' << endl;
			return;
		}
		break;
	}
	cout << 'P' << endl;
}


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

	for (ll n : query) {
		solve(n);
	}

	return 0;
}