#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

map<int, int> prime_fact(int n){
    map<int, int> pf;
    for(int i = 2; i*i <= n; ++i){
        if(n % i != 0) continue;
        int cnt = 0;
        while(n % i == 0){
            cnt++;
            n /= i;
        }
        pf[i] = cnt;
    }
    if(n != 1) pf[n] = 1;
    return pf;
}

int num_divisor(int n){
    const auto pf = prime_fact(n);
    int res = 1;
    for(auto p : pf) res *= (p.second + 1);
    return res;
}

int main(){
    int T;
    cin >> T;

    rep(t, 0, T){
        int N;
        cin >> N;

        if(N == 1) cout << 'P' << endl;
        else if(num_divisor(N) % 2 == 0) cout << 'K' << endl;
        else cout << 'P' << endl;
    }

    return 0;
}