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
#include <cstdio>
#include <cstdlib>
#include <algorithm>

using namespace std;

int W[5][3];

bool check() {
	for (int i = 0; i < 4; ++i) {
		for (int j = 0; j < 3; ++j) {
			if (W[i][j] < 1) {
				return 0;
			}
		}
	}
	for (int i = 0; i < 3; ++i) {
		if (W[4][i] < 2) {
			return 0;
		}
	}
	return 1;
}

int main() {
	int n;
	scanf("%d", &n);
	getchar();
	for (int i = 0; i < n; ++i) {
		char s[2];
		s[0] = getchar();
		s[1] = getchar();
		getchar();
		W[s[0] - '1'][s[1] - 'A']++;
	}
	if (check()) {
		printf("TAK\n");
	} else {
		printf("NIE\n");
	}
	return 0;
}