import sys
# sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

def prime_factorize(n):
    a = set()
    a.add(1)
    a.add(n)
    while n % 2 == 0:
       a.add(2)
       n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.add(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.add(n)
    return a

def sol():
    n = int(input())
    cnt = len(prime_factorize(n))
    if cnt%2:
        print('P')
    else:
        print('K')
T = int(input())
for i in range(T):
    sol()