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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int tasks[5][3];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		tasks[s[0] - '1'][s[1]-'A']++;
	}
	for (int i = 0; i < 5; i++) {
		for (int j = 0; j < 3; j++) {
			if (tasks[i][j] == 0) {
				cout << "NIE\n";
				return 0;
			}
			if (i == 4 && tasks[i][j] == 1) {
				cout << "NIE\n";
				return 0;
			}
		}
	}
	cout << "TAK\n";
}