def divisors(n):
  divisor=[]
  for i in range(1,int(n**0.5)+1):
    if n%i!=0:continue
    divisor.append(i)
    if i!=n//i:divisor.append(n//i)
  return sorted(divisor)

t=int(input())
for _ in range(t):
    n=int(input())
    div=divisors(n)
    print('K' if len(div)%2==0 else 'P' )