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
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
using namespace std;

#define boost ios::sync_with_stdio(0); cin.tie(0)
#define all(c) c.begin(), c.end()

typedef unsigned long long ll;
typedef signed long long sll;

const int mxn = 2e5;	
const int N = 1e9;

int tab[5][3];

void solve(){
	int n;
	cin >> n;
	string s;
	for(int i = 0; i < n; ++i){
		cin >> s;
		tab[int(s[0]) - 49][int(s[1]) - 65]++;
	}	
	bool ok = true;
	for(int i = 0; i < 5; ++i){
		for(int j = 0; j < 3; ++j){
			if(i < 4){
				if(tab[i][j] < 1){
					ok = false;	
				}
			}
			else{
				if(tab[i][j] < 2){
					ok = false;
				}
			}
		}
	}
	if(ok){
		cout << "TAK";
	}
	else{
		cout << "NIE";
	}
}

int main(){
	boost;
	int t = 1; 
	//cin >> t;
	while(t--){
		solve();
	}
}