import bisect

M = 3000000
lpf = list(range(M + 1))
primes = []
for p in range(2, M + 1):
    if lpf[p] == p:
        primes.append(p)
    for q in primes:
        if p * q > M or lpf[p] < q:
            break
        lpf[p * q] = q

for _ in range(int(input())):
    N = int(input())
    count = N - 2 - (bisect.bisect_left(primes, N) - bisect.bisect_right(primes, N // 2))
    if count % 2 == 1:
        print('K')
    else:
        print('P')