import sys
input = sys.stdin.readline

class UnionFind:
	def __init__(self, n):
		self.n = n
		self.parents = [-1] * n

	def find(self, x):
		if(self.parents[x] < 0):
			return x
		self.parents[x] = self.find(self.parents[x])
		return self.parents[x]

	def unite(self, x, y):
		x = self.find(x)
		y = self.find(y)
		if(x == y):
			return
		if(self.parents[x] > self.parents[y]):
			x, y = y, x
		self.parents[x] += self.parents[y]
		self.parents[y] = x

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

	def size(self, x):
		return -self.parents[self.find(x)]

	def members(self, x):
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i) == root]

	def roots(self):
		return [i for i, x in enumerate(self.parents) if x < 0]

"""
Main Code
"""

query = [int(input()) for _ in [0] * int(input())]

m = max(query)
rad = [0] * (m + 1)
for i in range(2, int(m ** 0.5 + 2)):
	if(rad[i] != 0):
		continue
	for j in range(i * i, m + 1, i):
		rad[j] = i

uni = UnionFind(m + 1)
ans = [''] * (m + 1)
for n in range(2, m + 1):
	if(rad[n] == 0):
		ans[n] = 'P'
		continue
	k = n
	while(rad[k] != 0):
		uni.unite(n, rad[k])
		d = rad[k]
		while(k % d == 0):
			k //= d
	if(k > 1):
		uni.unite(n, k)
	ans[n] = 'K' if((uni.size(n) - 1) & 1) else 'P'

for k in query:
	print(ans[k])