class PrimeNumbers:
    def __init__(self,nmax):
        from math import isqrt
        rootnmax = isqrt(nmax)
        self.prime_judgement = [True]*(rootnmax+1)
        self.prime_judgement[0] = self.prime_judgement[1] = False
        for i in range(2,rootnmax+1):
            if self.prime_judgement[i]:
                for j in range(2,rootnmax//i+1):
                    self.prime_judgement[i*j] = False
        self.prime_list = []
        for i,flag in enumerate(self.prime_judgement):
            if flag: self.prime_list.append(i)
from bisect import bisect_right
pn = PrimeNumbers(9*10**12); a = pn.prime_list; b = set(a)
for _ in range(int(input())):
    n = int(input())
    if n in b: print("P")
    else: print("K" if (n-2-bisect_right(a,n)+bisect_right(a,n//2))%2 else "P")