#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define PB push_back
constexpr int kN = int(1E5 + 10);

int a[kN], x[kN], ans[kN];

int main() {
	int n, sz;
	vector<int> tmp;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	x[0] = 0;
	for (int i = 1; i <= n; i++) x[i] = x[i - 1] ^ a[i];
	ans[n + 1] = 0;
	for (int i = n; i >= 1; i--) {
		tmp.clear();
		for (int j = i; j <= n; j++) tmp.PB(x[j] ^ x[i - 1] ^ ans[j + 1]);
		sort(tmp.begin(), tmp.end());
		tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
		sz = int(tmp.size());
		if (tmp.back() == sz - 1) ans[i] = sz;
		else for (int j = 0; j < sz; j++) if (tmp[j] != j) {
			ans[i] = j;
			break;
		}
	}

	if (ans[1]) printf("Takahashi\n");
	else printf("Takanashi\n");
}