#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
#define BIT(S,i) ((S&(1ll<<i))>0)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;

int dp[2020][3],N;

int solve(int n,int x,vector<int>&a){
	if(dp[n][x]!=-1)return dp[n][x];
	int &t = dp[n][x] = 0;
	if(x==2){
		if(solve(n,1,a)==0)return t = 1;
	}
	if(x){
		return t = (solve(n,0,a)^1);
	}
	int xors = 0;
	FOR(i,n+1,N+1){
		xors ^= a[i-1];
		if(solve(i,xors,a)==0)t=1;
	}
	return t;
}

signed main(){
	cin>>N;
	vector<int>a(N);
	REP(i,N)cin>>a[i];
	int now = 0,flg = -1;
	REP(i,N){
		now^=a[i];
		if(now==0)flg=i;
	}
	now=0;
	int flg1=0;
	if(flg!=N-1){
		RREP(i,N){
			now^=a[i];
			if(now==0)flg1=2;
		}
	}
	if(flg!=-1&&flg1==0)cout<<"Takahashi"<<endl;
	else cout<<"Takanashi"<<endl;
}