T = int(input())

def divisor(n):
    ans = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            ans.append(i)
            if i*i != n:
                ans.append(n//i)
    return sorted(ans)

ans = []
for i in range(T):
    N = int(input())
    D = divisor(N)
    if len(D) % 2 == 1:
        print("P")
    else:
        print("K")