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
#include <iostream>
#include <unordered_map>

using namespace std;


int main() {
  unordered_map<string, int> req = {
    {"1A", 1},
    {"1B", 1},
    {"1C", 1},
    {"2A", 1},
    {"2B", 1},
    {"2C", 1},
    {"3A", 1},
    {"3B", 1},
    {"3C", 1},
    {"4A", 1},
    {"4B", 1},
    {"4C", 1},
    {"5A", 2},
    {"5B", 2},
    {"5C", 2},
  };

  int n;
  cin >> n;

  for (int i = 0; i < n; ++i) {
    string s;
    cin >> s;
    (req.find(s) != req.end()) && (req[s] = max(req[s] - 1, 0));
  }

  for (auto &p : req) {
    if (p.second) {
      cout << "NIE" << endl;
      return 0;
    }
  }
  cout << "TAK" << endl;
  return 0;
}