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>
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define TRAV(i, a) for(auto & i : (a))
#define SZ(x) ((int)(x).size())
#define PR std::pair
#define MP std::make_pair
#define X first
#define Y second
typedef long long ll;
typedef std::pair<int, int> PII;
typedef std::vector<int> VI;

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

	int n;
	std::cin >> n;

	std::map<int, std::map<char, int> > map;

	FOR(i, n){
		std::string s;
		std::cin >> s;
		map[s[0]-'1'][s[1]]++;
	}

	VI need{1, 1, 1, 1, 2};
	FOR(i, 5){
		for(char c = 'A'; c <= 'C'; ++c){
			if(map[i][c] < need[i]){
				std::cout << "NIE\n";
				return 0;
			}
		}
	}
	std::cout << "TAK\n";

	return 0;
}