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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	const int mx = 3141592;
	vector<bool> p(mx);
	vector<ll> numpy(mx+1);
	rep(i,2,mx){
		numpy[i+1] += numpy[i];
		if (p[i]) continue;
		numpy[i+1] += 1;
		for (int j=2*i; j<mx; j+=i){
			p[j] = 1;
		}
	}
	int t; cin >> t; 
	while(t--){
		int n; cin >> n;
		if (!p[n]){
			cout << "P\n";
			continue;
		}
		// n/2 < t < n
		int tar = n - 1 - (numpy[n] - numpy[n/2 + 1]);
		if (tar % 2 == 0){
			cout << "K\n";
		}else{
			cout << "P\n";
		}
	}
}