import typing
import sys
from collections import defaultdict
input = lambda: sys.stdin.readline().strip()
inf = 10**18
mod = 998244353
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# sys.setrecursionlimit(10**6)
def primer(N):
  l = []
  cnt = 0
  while N%2 == 0:
    cnt += 1
    N //= 2
  if cnt:
    l.append((2, cnt))

  cnt = 0
  while N%3 == 0:
    cnt += 1
    N //= 3
  if cnt:
    l.append((3, cnt))

  for i in range(6, inf, 6):
    if (i-1)*(i-1) > N:
      break
    cnt = 0
    while N%(i-1) == 0:
      cnt += 1
      N //= (i-1)
    if cnt:
      l.append((i-1, cnt))

    if (i+1)*(i+1) > N:
      break
    cnt = 0
    while N%(i+1) == 0:
      cnt += 1
      N //= (i+1)
    if cnt:
      l.append((i+1, cnt))

  if N > 1:
    l.append((N, 1))

  return l

def solve():
  N = int(input())
  # 1つでも奇数の指数がある->先行
  for p, c in primer(N):
    if c%2 == 1:
      print('K')
      return 
  print('P')
  
def main():
  t = int(input())
  for _ in range(t):
    solve()
main()