#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e3 + 11;
int sg[N];

int a[N];
int s[N];

int f[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	reverse(a + 1, a + n + 1);
	for(int i = 1; i <= n; i ++)
		s[i] = s[i - 1] ^ a[i];
	
	sg[0] = 0;
	for(int i = 1; i <= n; i ++) {
		fill(f, f + i + 1, 0);
		for(int j = 0; j < i; j ++) {
			int x = sg[j] ^ s[j] ^ s[i];
			if(x <= i) f[x] = 1;
		}
		
		for(int j = 0; j <= i; j ++)
			if(!f[j]) {
				sg[i] = j;
				break;
			}
	}
	
	cout << (sg[n] ? "Takahashi" : "Takanashi") << '\n';
}