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
84
85
86
87
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container'.',hpp>
//#include <ext/pb_ds/tree_policy'.',hpp>
//typedef tree < int , null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> TREE;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
#define int long long
const int mod=1000000007;
//const int mod=1009;
//const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
using namespace std;


string Z[6]={"1","2","3","4","5","5"},D[3]={"A","B","C"};
map<string,int> M;
void solve()
{
    int n;
    cin>>n;
    for(int i=0;i<6;i++)
        for(int j=0;j<3;j++)
        {
            string a=Z[i];
            string b=D[j];
            string napis=a+b;
            M[napis]++;
        }
    bool czy=1;
    for(int i=1;i<=n;i++)
    {
        string napis;
        cin>>napis;
        M[napis]--;
    }
    for(int i=0;i<5;i++)
        for(int j=0;j<3;j++)
        {
            string a=Z[i];
            string b=D[j];
            string napis=a+b;
            if(M[napis]>0)
                czy=0;
        }
    if(czy)
        cout<<"TAK";
    else
    {
        cout<<"NIE";
    }
    
}   




int32_t main(){
    speed
    int t = 1;
    //cin >> t;
    while(t--){
    	solve();
    }
    return 0;
}