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 <map>

using namespace std;


map <string,int> mapa;

bool solution(int n)
{
     string tab[n];




    for(int i=0;i<n;i++)
        cin >> tab[i];

    for(int i=0;i<n;i++)
        ++mapa[tab[i]];



    int numer;
    char litera;

    int policz = 0;


    for(map<string, int>::iterator it = mapa.begin();it!=mapa.end();it++)
    {

        string key = it->first;

        numer = (int)key[0]-48;

        litera = key[1];

        int value = it->second;


        if(numer==5)
        {
            policz+=2;

            if(value<2)
                return false;

        }
        else
            policz++;



    }


    if(policz!=18)
        return false;




    return true;

}


int main()
{

    int n;

    cin >> n;

   if(solution(n)==false)
    cout << "NIE" << endl;
   else
    cout << "TAK" << endl;


    return 0;
}