#include int main () { int t = 0; int n = 0; int res = 0; int flag[3000001] = {}; int cnt[3000001] = {}; flag[1] = 1; for (int p = 2; p <= 3000000; p++) { if (flag[p] <= 0) { for (int q = 2; q*p <= 3000000; q++) { flag[p*q] = 1; } } cnt[p] = cnt[p-1]+1-flag[p-1]; } res = scanf("%d", &t); while (t > 0) { res = scanf("%d", &n); if (flag[n] <= 0 || (n-cnt[n]+cnt[1+n/2])%2 == 0) { printf("P\n"); } else { printf("K\n"); } t--; } return 0; }