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
73
74
75
76
77
78
79
80
81
82
83
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

int n;
string s;
unordered_map<string, int> required, actual;

void initRequired()
{
    for(int i = 1; i <= 5; ++i)
    {
        for(char c = 'A'; c <= 'C'; ++c)
        {
            const string key = char(i+'0') + string(1, c);
            required[key] = (i == 5 ? 2 : 1);
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    initRequired();

    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> s;
        ++actual[s];
    }

    for(auto it = required.begin(); it != required.end(); ++it)
    {
        if(actual[it->first] < it->second)
        {
            cout << "NIE" << endl;
            return 0;
        }
    }

    cout << "TAK" << endl;

    return 0;
}