1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    map<string, int> dupa;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        dupa[s]++;
    }

    for (int i = 1; i <= 5; i++) {
        int need = 1;
        if (i == 5) need = 2;
        for (char c = 'A'; c <= 'C'; c++) {
            string s = "OK";
            s[0] = '0' + i;
            s[1] = c;
            if (dupa[s] < need) {
                cout << "NIE\n";
                return;
            }
        }
    }
    cout << "TAK\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cout.precision(15);
    cout << fixed;
    cin.tie(0);

    int T = 1;
    //cin >> T;
    for (int tst = 0; tst < T; tst++) {
        solve();
    }

    return 0;
}