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
#include <bits/stdc++.h>

using namespace std;


typedef long long LL;


int p[100][100];


int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	while (n--) {
		string s;
		cin >> s;

		int r = s[0] - '0';
		int d = s[1] - 'A';

		p[r][d]++;
	}

	int req[] = { 0, 1, 1, 1, 1, 2 };

	for (int i = 1; i <= 5; ++i) {
		for (int j = 0; j < 3; ++j) {
			if (p[i][j] < req[i]) {
				cout << "NIE" << endl;
				return 0;
			}
		}
	}

	cout << "TAK" << endl;
}