#include <bits/stdc++.h>
// #include <atcoder/all>
#include <iostream>
#include <math.h>

using namespace std;
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using ll = long long;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)
#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)

const ll inf = ll(1e9+7);

vector< bool > prime_table(int n) {
  vector< bool > prime(n + 1, true);
  if(n >= 0) prime[0] = false;
  if(n >= 1) prime[1] = false;
  for(int i = 2; i * i <= n; i++) {
    if(!prime[i]) continue;
    for(int j = i * i; j <= n; j += i) {
      prime[j] = false;
    }
  }
  return prime;
}

vector< int > enumerate_primes(int n) {
  if(n <= 1) return {};
  auto d = prime_table(n);
  vector< int > primes;
  primes.reserve(count(begin(d), end(d), true));
  for(int i = 0; i < d.size(); i++) {
    if(d[i]) primes.push_back(i);
  }
  return primes;
}

set< int > create_prime_set( int n){
    set<int> ret;
    if (n <= 1) return ret;
    auto d = prime_table(n);
    for (int i = 0; i < d.size(); i++){
        if (d[i]) ret.insert(i);
    }
    return ret;
}

int main() {
    int t;
    cin >> t;
    auto st = create_prime_set(3000009);
    auto primes = enumerate_primes(3000009);
    rep(_, t){
        int n;
        cin >> n;
        if (st.count(n)) cout << 'P' << endl;
        else{
            auto it1 = upper_bound(primes.begin(), primes.end(), n);
            auto it2 = upper_bound(primes.begin(), primes.end(), n/2);
            int pos = (n-2) - (it1 - it2);
            if (pos % 2 == 0) cout << 'P' << endl;
            else cout << 'K' << endl;
        }
    }
    return 0;
}