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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int problems[6][3];

int main() {
  ios_base::sync_with_stdio(false);

  int n;
  cin >> n;

  for(int i = 0; i < n; ++i) {
    string zad;
    cin >> zad;
    problems[zad[0]-'0'][zad[1]-'A']++;
  }

  bool ok = true;

  for(int i = 1; i < 5; ++i) {
    for(int j = 0; j < 3; ++j) {
      if(problems[i][j] == 0) {
        ok = false;
      }
    }
  }

  for(int j = 0; j < 3; ++j) {
    if(problems[5][j] < 2)
      ok = false;
  }

  if(ok) {
    cout << "TAK\n";
  } else {
    cout << "NIE\n";
  }
}