use proconio::input;

fn main() {
    input! {
        t: usize,
        nn: [usize; t],
    }

    for n in nn {
        println!(
            "{}",
            if find_divisors(n).len() % 2 == 0 {
                'K'
            } else {
                'P'
            }
        );
    }
}

/// Creates a sequence consisting of the divisors of `n`.
pub fn find_divisors(n: usize) -> Vec<usize> {
    assert_ne!(n, 0, "`n` must be at least 1.");

    let mut divisors = vec![];

    for i in (1..).take_while(|&i| i <= n / i) {
        if n % i == 0 {
            divisors.push(i);

            if n / i != i {
                divisors.push(n / i);
            }
        }
    }

    divisors.sort_unstable();

    divisors
}