#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod){ return my_pow(x, mod - 2, mod); } int main(){ vvl vec(3000001, vl(0)); for (ll i = 2; i <= 3000000; i++){ for (ll j = 2; j * i <= 3000000; j++){ vec[j * i].push_back(i); } } ll T; cin >> T; vpll query(T); for (ll i = 0; i < T; i++){ ll N; cin >> N; query[i] = (pll(N, i)); } //debug(query); sort(all(query)); vl ans(T, -1); dsu tree(3000001); for (ll i = 2; i <= query[0].first; i++){ for (ll j = 0; j < vec[i].size(); j++){ tree.merge(i, vec[i][j]); } } ans[query[0].second] = tree.size(query[0].first); for (ll i = 1; i < T; i++){ for (ll j = query[i - 1].first + 1; j <= query[i].first; j++){ for (ll k = 0; k < vec[j].size(); k++){ tree.merge(j, vec[j][k]); } } ans[query[i].second] = tree.size(query[i].first); } //debug(ans); for (ll i = 0; i < T; i++){ if (ans[i] % 2 == 1) cout << 'P' << endl; else cout << 'K' << endl; } }