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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

#include <bits/stdc++.h>
using namespace std;
/*
 * AC 自动机：多个模式串去匹配一个串，求有多少个模式串与主串有匹配内容
 *
 * 使用操作：
 * 1、把每一个模式串插入到树中 insert
 * 2、build
 * 3、使用 query 询问有多少个模式串匹配
 */
const int CHAR_NUM = 2;//仅小写
const int MAXN = 2100;//模式串个数
const int MAXM = 30100;//模式串最长长度
const int NUM = MAXN * MAXM;//空间=个数*长度，稳
struct Trie {
    int c[NUM][CHAR_NUM], val[NUM], fail[NUM], cnt;
    void insert(char *s) {
        int len = strlen(s);
        int now = 0;
        for (int i = 0; i < len; i++) {
//            int v = s[i] - 'a';
            int v = s[i] - '0';
            if (!c[now][v])c[now][v] = ++cnt;
            now = c[now][v];
        }
        val[now]++;
    }
    void build() {
        queue<int> q;
        for (int i = 0; i < CHAR_NUM; i++)if (c[0][i])fail[c[0][i]] = 0, q.push(c[0][i]);
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int i = 0; i < CHAR_NUM; i++)
                if (c[u][i])fail[c[u][i]] = c[fail[u]][i], q.push(c[u][i]);
                else c[u][i] = c[fail[u]][i];
        }
    }
    int query(char *s) {
        int len = strlen(s);
        int now = 0, ans = 0;
        for (int i = 0; i < len; i++) {
//            now = c[now][s[i] - 'a'];
            now = c[now][s[i] - '0'];
            for (int t = now; t && ~val[t]; t = fail[t])ans += val[t], val[t] = -1;
        }
        return ans;
    }
} AC;
char s[30100];
bool vis[NUM];
bool dfs(int cur) {
    for (int i = 0; i < CHAR_NUM; ++i) {
        int x = AC.c[cur][i];
        if (!AC.val[x]) {
            bool flag = false;
            int t = x;
            while (t) {
                if (AC.val[t]) {
                    flag = true;
                    break;
                }
                t = AC.fail[t];
            }
            if (flag)
                continue;
            if (vis[x])
                return true;
            vis[x] = true;
            if (dfs(x)) {
                return true;
            }
            vis[x] = false;
        }
    }
    return false;
}
void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> s;
        AC.insert(s);
    }
    AC.build();
    vis[0] = true;
    bool flag = dfs(0);
    if (flag) {
        cout << "TAK" << endl;
    } else {
        cout << "NIE" << endl;
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef ACM_LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    long long test_index_for_debug = 1;
    char acm_local_for_debug;
    while (cin >> acm_local_for_debug) {
        cin.putback(acm_local_for_debug);
        if (test_index_for_debug > 20) {
            throw runtime_error("Check the stdin!!!");
        }
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    }
#else
    solve();
#endif
    return 0;
}