#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

int grundy[2010];

int main(){
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];
    vector<int> xorsum(N+1);
    rep(i,N){
        xorsum[i+1] = xorsum[i]^A[i];
    }
    repr(i,1,N+1){
        set<int> st;
        for(int j = N; j >= N-i+1; j--){
            st.insert(xorsum[j]^xorsum[N-i]^grundy[N-j]);
        }

        int k = 0;
        while(st.count(k) != 0) k++;
        grundy[i] = k;
        //cout << i << " " << grundy[i] << endl;
        //for(int u : st) cout << u << " ";
        //cout << endl;
    }
    if(grundy[N] == 0){
        cout << "Takanashi" << endl;
    }
    else cout << "Takahashi" << endl;

}