from bisect import bisect_right
INFTY = 3*10**6
P = list(range(INFTY+1))
for i in range(2,INFTY+1):
    if i*i>INFTY:
        break
    for j in range(i*i,INFTY+1,i):
        P[j] = P[i]
Q = []
for i in range(2,INFTY+1):
    if P[i]==i:
        Q.append(i)
T = int(input())
for _ in range(T):
    N = int(input())
    C = {}
    cur = N
    while cur>1:
        C[P[cur]] = C.get(P[cur],0)+1
        cur //= P[cur]
    C = list(C.items())
    if len(C)==1 and C[0][1]==1:
        cnt = 0
    else:
        ind1 = bisect_right(Q,N)
        ind = bisect_right(Q,N//2)
        cnt = N-2-(ind1-ind)
    if cnt%2==0:
        print("P")
    else:
        print("K")