48秋调

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
#define int long long
#define all(x) x.begin(), x.end()

inline void cmax(int &x, const int &y) {(x < y ? x = y : 1);}
inline void cmin(int &x, const int &y) {(x > y ? x = y : 1);}

const int MAXN = 3e4 + 5;

vector<int> G[MAXN];

struct ACAM{
    int trie[MAXN][26], val[MAXN], fail[MAXN], vis[MAXN];
    int cnt = 0;

    void insert(string a) {
        int u = 0;
        for(int i = 0; i < a.size(); ++i) {
            
            int &v = trie[u][a[i] - '0'];
            if(!v) v = ++cnt;
            G[u].push_back(trie[u][a[i] - '0']);
            u = v;
        }
        ++val[u];
    }

    void build() {
        queue<int> q;
        for(int i = 0; i < 2; ++i)
            if(trie[0][i]) q.push(trie[0][i]);
        while(!q.empty()) {
            int u = q.front(); q.pop();
            for(int i = 0; i < 2; ++i) {
                int &v = trie[u][i];
                if(v) {
                    fail[v] = trie[fail[u]][i];
                    if(val[fail[v]]) val[v] ++;
                    q.push(v);
                } else {
                    v = trie[fail[u]][i];
                }
            }
        }
    }
} trie;

string s[MAXN];

int flag = 0;
int vis[MAXN];

bool dfs(int u, int fa) { // cout << u << "\n";
    if(vis[u]) return 1;
    bool ret = 0;
    vis[u] ++;
    for(int i = 0; i < 2; i ++) {
        int v = trie.trie[u][i];
        if(v == 0) continue;
        if(trie.val[v]) continue;
        if(vis[v]) ret = 1;
        ret |= dfs(v, u);
    }
    return ret;
}

void solve() {
    int n; cin >> n;
    for(int i = 1; i <= n; i ++) cin >> s[i], trie.insert(s[i]);
    trie.build();
    if(dfs(0, -1)) cout << "TAK";
    else cout << "NIE";
}

signed main(){
    ios::sync_with_stdio(false), cin.tie(0);
    #ifndef ONLINE_JUDGE
        freopen("txt.in", "r", stdin);
        freopen("txt.out", "w", stdout);
    #endif
    int T = 1;
    // cin >> T;
    while(T --) solve();
    return 0;
}