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

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) {
      res = res * t;
    }
    t = t * t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 ttt;
  cin >> ttt;
  vector<bool> isprime(4000000, true);
  vector<i64> p;
  isprime[0] = isprime[1] = false;
  for (i64 i = 2; i < isprime.size(); i++) {
    if (!isprime[i]) continue;
    p.push_back(i);
    for (i64 j = i + i; j < isprime.size(); j += i) {
      isprime[j] = false;
    }
  }
  for (;ttt--;) {
    i64 n;
    cin >> n;
    if (isprime[n]) {
      cout << "P\n";
      continue;
    }
    i64 i = upper_bound(p.begin(), p.end(), n / 2) - p.begin() - 1;
    i64 j = upper_bound(p.begin(), p.end(), n) - p.begin() - 1;
    i64 sum = n - 2;
    sum -= j - i;
    cout << (sum % 2 == 0 ? "P\n" : "K\n");
  }
}