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
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

map<string,int> cnt;

int main() {
	int n;
	cin >> n;
	FOR(i,n) {
		string s;
		cin >> s;
		cnt[s]++;
	}
	FORI(r,5) FOR(d,3) {
		string cur = "";
		cur += '0'+r;
		cur += 'A'+d;
		//cout << "Checking if cnt[" << cur << "] >= " << (r==5?2:1) << "\n";
		if (cnt[cur] < (r==5?2:1)) {
			cout << "NIE\n";
			return 0;
		}
	}
	cout << "TAK\n";
	return 0;
}