#include using namespace std; #define SZ(x) (int) (x).size() #define REP(i, n) for(int i = 0; i < (n); i++) #define FOR(i, a, b) for(auto i = (a); i < (b); i++) #define For(i, a, b, c) \ for(auto i = (a); i != (b); i += (c)) #define REPR(i, n) for(auto i = (n) -1; i >= 0; i--) #define ALL(s) (s).begin(), (s).end() #define so(V) sort(ALL(V)) #define rev(V) reverse(ALL(V)) #define uni(v) v.erase(unique(ALL(v)), (v).end()) #define eb emplace_back typedef unsigned long long ull; typedef long long ll; typedef vector vi; typedef vector vll; typedef vector vb; typedef vector vvi; typedef vector vvll; typedef pair PI; typedef pair PL; const double EPS = 1e-6; const int MOD = 1e9 + 7; const int INF = (1 << 30); const ll LINF = 1e18; const double math_PI = acos(-1); template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>( a, make_v(ts...)); } template typename enable_if::value == 0>::type fill_v( T& t, const V& v) { t = v; } template typename enable_if::value != 0>::type fill_v( T& t, const V& v) { for(auto& e: t) fill_v(e, v); } template bool chmax(T& a, const T& b) { if(a < b) { a = b; return true; } return false; } template bool chmin(T& a, const T& b) { if(a > b) { a = b; return true; } return false; } template istream& operator>>(istream& is, pair& p) { cin >> p.first >> p.second; return is; } template istream& operator>>(istream& is, vector& vec) { for(T& x: vec) is >> x; return is; } template string join(vector& vec, string splitter) { stringstream ss; REP(i, SZ(vec)) { if(i != 0) ss << splitter; ss << vec[i]; } return ss.str(); } template ostream& operator<<(ostream& os, vector& vec) { os << join(vec, " "); return os; } #ifdef LOCAL #include "./cpp-dump/dump.hpp" #include "./cpp-dump/mytypes.hpp" #define dump(...) cpp_dump(__VA_ARGS__) namespace cp = cpp_dump; #else #define dump(...) #define preprocess(...) #define CPP_DUMP_SET_OPTION(...) #define CPP_DUMP_DEFINE_EXPORT_OBJECT(...) #define CPP_DUMP_DEFINE_EXPORT_ENUM(...) #define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...) #endif void eratos(int n, vb& isprime) { isprime = vb(n + 1, true); isprime[0] = false; isprime[1] = false; int last = ((int) sqrt(n)) + 1; FOR(i, 2, last) { if(isprime[i]) { int j = i + i; while(j <= n) { isprime[j] = false; j += i; } } } } map prime_factor(ll n) { map ret; for(ll i = 2; i * i <= n; i++) { while(n % i == 0) { ret[i]++; n /= i; } } if(n != 1) ret[n] = 1; return ret; } vi sieve(int n) { n++; vi res(n); std::iota(res.begin(), res.end(), 0); for(int i = 2; i * i < n; ++i) { if(res[i] < i) continue; for(int j = i * i; j < n; j += i) if(res[j] == j) res[j] = i; } return res; } map factor(int n, const vi& min_factor) { map res; while(n > 1) { res[min_factor[n]]++; n /= min_factor[n]; } return res; } const int MAX_N = 3000000; vi ans(MAX_N + 1); vb isPrime; void solve() { int N; cin >> N; if(isPrime[N]) { cout << "P" << endl; } else if(ans[N] % 2 == 1) { cout << "P" << endl; } else { cout << "K" << endl; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); preprocess(); eratos(MAX_N + 1, isPrime); vb V(MAX_N + 1); V[0] = true; int cur = 0; FOR(i, 4, MAX_N + 1) { if(V[i]) cur++; if(!V[i / 2]) { int j = i / 2; while(j <= MAX_N) { if(!V[j] && j <= i) cur++; V[j] = true; j += i / 2; } } ans[i] = cur; } int T; cin >> T; while(T--) { solve(); } return 0; }