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
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1000*1000 + 7;
const int INF = 1000*1000*1000 + 7;

int ile[10][10];

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		char c, z;
		cin >> c >> z;
		ile[c-'0'][z-'A']++;
	}
	bool wynik = true;
	for(int i = 1; i <= 4; i++)
		for(int j = 0; j <= 2; j++)
			if(ile[i][j] == 0)
				wynik = false;
	for(int j = 0; j <= 2; j++)
		if(ile[5][j] <= 1)
			wynik = false;
	cout << (wynik ? "TAK" : "NIE") << '\n';
	return 0;
}