import sys
input = sys.stdin.readline

def eratos(n):
    is_prime = [1] * (n + 1)
    for j in range(4, n + 1, 2):
        is_prime[j] = 0
    for i in range(3, int(n ** 0.5 + 2), 2):
        if not(is_prime[i]):
            continue
        for j in range(i * i, n + 1, i):
            is_prime[j] = 0
    return is_prime

t = int(input())
query = [int(input()) for _ in [0] * t]
m = max(query)
is_prime = eratos(m)
dp = is_prime[:]
for i in range(3, m + 1):
    dp[i] += dp[i - 1]
for n in query:
    if(is_prime[n]):
        print('P')
        continue
    cnt = (n - 2) - dp[n] + dp[n // 2]
    if(cnt & 1):
        print('K')
    else:
        print('P')