#include <bits/stdc++.h>
using namespace std;
int n,trie[30010][2],id=1,fail[30010];
bool vis[30010],ok;
int viss[30010];
string s[2010];
queue<int> q;
void build_trie(int x){
	int u=1,len=s[x].size()-1;
	for(int i=1;i<=len;i++){
		if(!trie[u][s[x][i]-'0']) trie[u][s[x][i]-'0']=++id;
		u=trie[u][s[x][i]-'0'];
	}
	vis[u]=true;
}
void build_fail(){
	for(int i=0;i<2;i++) 
		if(trie[1][i]){
			q.push(trie[1][i]);
			fail[trie[1][i]]=1;
		} 
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=0;i<2;i++){
			if(trie[u][i]){
				fail[trie[u][i]]=trie[fail[u]][i];
				vis[trie[u][i]]|=vis[fail[trie[u][i]]];
				q.push(trie[u][i]);
			}else trie[u][i]=trie[fail[u]][i];
		}
	}
}
void dfs(int x){
	viss[x]=1;
	for(int i=0;i<2;i++){
		if(!trie[x][i]||vis[trie[x][i]]) continue;
		if(viss[trie[x][i]]==-1) dfs(trie[x][i]);
		else if(viss[trie[x][i]]==1){
			ok=true;
			return;
		}
		if(ok) return;
	}
	viss[x]=0;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i];
		s[i]=' '+s[i];
		build_trie(i);
	}
	build_fail();
	memset(viss,-1,sizeof(viss));
	dfs(1);
	if(ok) printf("TAK");
	else printf("NIE");
	return 0;
}