#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]; map<int,int> memo[2020]; int grundy(int nim,int cur) { if(cur==N) return nim; if(memo[cur].count(nim)) return memo[cur][nim]; set<int> S; int take; int x=0; for(take=1;cur+take<=N;take++) { x^=A[cur+take-1]; S.insert(grundy(nim^x,cur+take)); } for(x=1;x<=nim;x++) S.insert(grundy(nim-x,cur)); x=0; while(S.count(x)) x++; cout<<cur<<nim<<" "<<x<<endl; return memo[cur][nim]=x; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N; x=0; FOR(i,N) { cin>>A[i]; x^=A[i]+1; } if(x) cout<<"Takahashi"<<endl; else cout<<"Takanashi"<<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; }