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

ll all_stones[3000001];
vector<int> primes[3000001];

void init(){
    for(int i = 2;i<=3000000;++i){
        if(primes[i].size()==0){
            for(int j = i;j<=3000000;j+=i){
                primes[j].push_back(i);
            }
        }
    }
    dsu d(3000001);
    for(int i = 2;i<=3000000;++i){
        for(auto p : primes[i]){
            d.merge(i,p);
        }
        all_stones[i] = d.size(i);
    }
}

ll N;

void solve(){
    if(all_stones[N]%2==0){
        cout<<"K"<<'\n';
    }else{
        cout<<"P"<<"\n";
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    init();
    int T;
    cin >> T;
    while(T--){
        cin >> N;
        solve();
    }
}