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
45
46
47
48
49
50
51
52
#include <iostream>

using namespace std;

const int N = 1 << 5;

int n;
int Cnt[N];

void init() {
   cin >> n;

   for (int i=0; i<n; i++) {
       string task;
       cin >> task;
        
       Cnt[(task[0]-'0'-1)*3+task[1]-'A']++;
   }
}

void solve() {
   bool possible = 1; 
    
   for (int i=0; i<12; i++) {
       if (Cnt[i] < 1) {
           possible = 0; 
       }               
   }
 
   for (int i=12; i<15; i++) {
       if (Cnt[i] < 2) {
           possible = 0; 
       }
   }
    
   if (possible == 0) {
       cout << "NIE\n";
   } else {
       cout << "TAK\n"; 
   }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    init();
    solve();

    return 0;
}