#include using namespace std; //#include //using namespace atcoder; //using mint = modint998244353; //多倍長整数// //#include //namespace mp = boost::multiprecision; //using bint = mp::cpp_int; const int INF = 1e9; const int MOD = 998244353; const long long LINF = 4e18; using ll = long long; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using vb = vector; using vvi = vector>; using vvvi = vector>>; using vvvvi = vector>>>; using vvl = vector>; using vvvl = vector>>; using vvvvl = vector>>>; using vvc = vector>; using vvb = vector>; using vvvb = vector>>; using vvvvb = vector>>>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define dump(x) cout << #x << " = " << (x) << endl; #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define ALL(obj) (obj).begin(),(obj).end() vector divisor(long long n){ vector ans; for(long long i = 1;i*i <= n;i++){ if(n % i == 0){ ans.push_back(i); if(i != n/i) ans.push_back(n/i); } } sort(ans.begin(),ans.end()); return ans; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; for(;t--;){ int n; cin >> n; auto a = divisor(n); n = a.size(); if(n%2 == 0) cout << 'K' << "\n"; else cout << "P\n"; } return 0; }