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
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
using namespace std;
void input(int &n, unordered_map<string, int> &count) {
  string x;
  cin >> n;
  while (n--) {
    cin >> x;
    count[x]++;
  }
}
bool solve(unordered_map<string, int> &count, unordered_map<string, int> &expected) {
  for (auto [key, val] : expected) {
    if (val > count[key]) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  unordered_map<string, int> count;
  unordered_map<string, int> expected = {{"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}};
  input(n, count);
  cout << (solve(count, expected) ? "TAK\n" : "NIE\n");
  return 0;
}