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
/*
 *  Copyright (C) 2020  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <iostream>
#include <array>
using namespace std;


int index(int round, char division) {
	return (round - 1) * 3 + int(division) - 65;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, round;
	char division;
	array<int, 15> counter = {0};

	cin >> n;

	for (int i = 0; i < n; ++i) {
		cin >> round >> division;
		counter[index(round, division)] += 1;
	}

	for (unsigned int i = 0; i < counter.size(); ++i) {
		if (counter[i] < 1 || (i >= 12 && counter[i] < 2)) {
			cout << "NIE" << endl;
			return 0;
		}
	}

	cout << "TAK" << endl;
	return 0;
}