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


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<int> rad(m + 1);
	for (int i = 2; i * i <= m; i++) {
		if (rad[i] != 0) {
			continue;
		}
		for (int j = i * i; j <= m; j += i) {
			rad[j] = i;
		}
	}

	vector<char> ans(m + 1);
	dsu uni(m + 1);
	for (int n = 2; n <= m; n++) {
		if (n == rad[n]) {
			ans[n] = 'P';
		}
		int k = n;
		while (rad[k] != 0) {
			uni.merge(n, rad[k]);
			int d = rad[k];
			while (k % d == 0) {
				k /= d;
			}
		}
		if (k > 1) {
			uni.merge(n, k);
		}
		ans[n] = ((uni.size(n) - 1) & 1) ? 'K' : 'P';
	}

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

	return 0;
}