from collections import Counter


def factorize(n: int) -> list[int]:
    res = []
    p = 2
    while p * p <= n:
        while n % p == 0:
            res.append(p)
            n //= p
        p += 1
    if n > 1:
        res.append(n)

    return res


def number_of_divisors(n: int) -> int:
    """n の約数の個数を求める"""
    res = 1
    for v in Counter(factorize(n)).values():
        res *= v+1

    return res


def solve() -> bool:
    N = int(input())
    x = number_of_divisors(N)
    return x % 2 == 0


T = int(input())
for _ in range(T):
    if solve():
        print('K')
    else:
        print('P')