import sys
input = sys.stdin.readline

N = int(input())

is_prime = [True] * (N + 1)
is_prime[0] = is_prime[1] = False
for i in range(2, N):
	if not(is_prime[i]):
		continue
	for j in range(i << 1, N + 1, i):
		is_prime[j] = False

prime_cnt = [0] * (N + 1)
half_prime_cnt = [0] * (N + 1)
for n in range(2, N + 1):
	prime_cnt[n] = prime_cnt[n - 1] + is_prime[n]
	half_prime_cnt[n] += half_prime_cnt[n - 1]
	if(is_prime[n]):
		print('P')
		k = n << 1
		if(k <= N):
			half_prime_cnt[k] += 1
		continue
	if((prime_cnt[n] - half_prime_cnt[n]) & 1):
		print('K')
	else:
		print('P')