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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <iostream>
#include <algorithm>

#define FOR(name, j)  for(int name = 0; name <  (j); name++)
#define MAX(a,b)      ((a) > (b) ? (a) : (b))
#define MIN(a,b) 	  ((a) < (b) ? (a) : (b))
#define checkbit(n,b) ((n >> b) & 1)
#define INF           (int)1000000000
#define ll 			  long long

using namespace std;

int exercises[5][3];

void prepareExerciseTable() {
	for(int i = 0; i < 5; i++) {
		for(int j = 0; j < 3; j++) {
			exercises[i][j] = 0;
		}
	}
}

void loadNextExcercise() {
	char num, div;
	scanf(" %c%c", &num, &div);
	int number = num - '0';
	int division = div - 'A';
	
	exercises[number - 1][division]++;
}

bool areFirst4Good() {
	for(int i = 0; i < 4; i++) {
		for(int j = 0; j < 3; j++) {
			if(exercises[i][j] < 1) {
				return false;
			}
		}
	}
	return true;
}

bool areFinalGood() {
	for(int i = 0; i < 3; i++) {
		if(exercises[4][i] < 2) {
			return false;
		}
	}
	return true;
}

bool isSetPossible() {
	return areFirst4Good() && areFinalGood();
}

int main(int argc, char *argv[]) {
	int n;
	scanf("%i", &n);

	prepareExerciseTable();
	for(int i = 0; i < n; i++) {
		loadNextExcercise();
	}

	if(isSetPossible()) {
		printf("TAK\n");
	} else {
		printf("NIE\n");
	}

	return 0;
}