import sys
input = sys.stdin.readline

class UnionFind():
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]

T = int(input())
M = 3 * 10 ** 6 + 5
L = [0] * M
G = [[] for i in range(M)]
for i in range(2, M):
    if L[i]:
        continue
    for j in range(2 * i, M, i):
        G[j].append(i)
        L[j] = 1
        
U = UnionFind(M)
ans = [0] * M
for i in range(2, M):
    for j in G[i]:
        U.union(i, j)
    ans[i] = U.get_size(i)

for _ in range(T):
    print("K") if ans[int(input())] % 2 == 0 else print("P")