def Prime(N):
  Is_prime = [1 for i in range(N+1)]
  Is_prime[0] = Is_prime[1] = 0
  for p in range(2,N):
    if Is_prime[p] == 0:
      continue
    for d in range(2,N//p + 1):
      Is_prime[p*d] = 0
  return Is_prime

P = Prime(3*10**6)
for i in range(3*10**6):
  P[i+1] += P[i]

T = int(input())
for _ in range(T):
  ans = 'P'
  N = int(input())
  if P[N] - P[N-1]:
    print(ans)
    continue
  else:
    res = N - (P[N] - P[N//2])
    if res % 2:
      ans = 'K'
    print(ans)