import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum LIM = 3 * 10^^6 + 10; void main() { auto lpf = iota(LIM).array; foreach (p; 2 .. LIM) if (lpf[p] == p) { for (int n = p; n < LIM; n += p) chmin(lpf[n], p); } auto pi = new int[LIM]; foreach (n; 2 .. LIM) { pi[n] = pi[n - 1] + ((lpf[n] == n) ? 1 : 0); } try { for (; ; ) { const numCases = readInt; foreach (caseId; 0 .. numCases) { const N = readInt; int ans; if (lpf[N] == N) { ans = 1; } else { ans = N - 1; ans -= (pi[N] - pi[N / 2]); } debug { writeln("ans = ", ans); } writeln("KP"[ans & 1]); } } } catch (EOFException e) { } }