//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

int n;
int a[2010], sum[2010];
int g[2010];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  rep(i, n) cin >> a[i];

  rep(i, n) sum[i+1] = sum[i] ^ a[i];

  for(int i = n-1; i >= 0; i--) {
    vi mex = {-1, INT_MAX};
    for(int j = i; j < n; j++) {
      mex.emplace_back(g[j+1]^sum[j+1]^sum[i]);
    }
    sort(all(mex));
    rep(j, mex.size()-1) {
      if(abs(mex[j]-mex[j+1]) > 1) {
        g[i] = mex[j]+1;
        break;
      }
    }
  }

  cout << (g[0]?"Takahashi":"Takanashi") << endl;
}