#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll A[2020];

int memo[2020];

int grundy(int cur) {
	if(cur==N) return 0;
	
	if(memo[cur]>=0) return memo[cur];
	
	set<int> S;
	int x=0;
	for(int take=1;cur+take<=N;take++) {
		x^=A[cur+take-1];
		S.insert(x^grundy(cur+take));
	}
	x=0;
	while(S.count(x)) x++;
	return memo[cur]=x;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i];
	}
	
	MINUS(memo);
	if(grundy(0)==0) cout<<"Takanashi"<<endl;
	else cout<<"Takahashi"<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}