#include <bits/stdc++.h>

using LL = long long;

const int N = 22;
const int MOD = 1e9 + 7;

LL n;

void solve() {
  scanf("%lld", &n);
  int m = 2;
  while(m < n && n % m == 0)
    ++m;
  putchar(std::__gcd(LL(m), n) == 1 ? 'K' : 'P');
  putchar(10);
}

int main() {

  int cases;
  scanf("%d", &cases);

  while(cases--)
    solve();
  
  return 0; 

}