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)); }




void main() {
  debug {{
    foreach (n; 2 .. 200 + 1) {
      auto dp = new bool[n + 1];
      foreach (y; 2 .. n + 1) {
        foreach (x; 2 .. y + 1) {
          if (n % x != 0 && gcd(x, y) == 1) {
            if (!dp[x]) dp[y] = true;
          }
        }
      }
      if (n <= 10) {
        // writeln(n, ": ", dp[n], " ", dp);
      }
      if (!dp[n]) {
        writeln(n, ": ", dp);
      }
      assert(!dp[n] == (n == 2 || n % 12 == 6));
    }
  }}
  
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readLong;
        
        writeln((N == 2 || N % 12 == 6) ? "P" : "K");
      }
    }
  } catch (EOFException e) {
  }
}