#include <bits/stdc++.h>
using namespace std;

const vector<string> KCPC = {
    "#...#.#####",
    "#.##..#....",
    "##....#....",
    "#.##..#....",
    "#...#.#####",
    "...........",
    "####..#####",
    "#...#.#....",
    "####..#....",
    "#.....#....",
    "#.....#####"
}, KUPC = {
    "#...#.#...#",
    "#.##..#...#",
    "##....#...#",
    "#.##..#...#",
    "#...#.#####",
    "...........",
    "####..#####",
    "#...#.#....",
    "####..#....",
    "#.....#....",
    "#.....#####"
};

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int N;
    cin >> N;
    assert(N % 11 == 0);
    int k = N / 11;
    assert(1 <= k && k <= 10);
    vector<string> S(N);
    for (int i = 0; i < N; i++) {
        cin >> S[i];
        assert(S[i].size() == N);
    }
    bool isKCPC = true, isKUPC = true;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (KCPC[i / k][j / k] != S[i][j]) isKCPC = false;
            if (KUPC[i / k][j / k] != S[i][j]) isKUPC = false;
        }
    }
    assert(isKCPC ^ isKUPC);
    assert(k == 7);
    if (isKCPC) cout << "KCPC" << endl;
    if (isKUPC) cout << "KUPC" << endl;
    return 0;
}