#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

bool solve(int n, const vector<int> & a) {
    vector<int> g(n + 1);
    REP_R (i, n) {
        set<int> h;
        int acc = 0;
        REP3 (j, i, n) {
            acc ^= a[j];
            h.insert(acc ^ g[j + 1]);
        }
        while (h.count(g[i])) {
            ++ g[i];
        }
    }
    return g[0];
}

int main() {
    int n; cin >> n;
    vector<int> a(n);
    REP (i, n) {
        cin >> a[i];
    }
    cout << (solve(n, a) ? "Takahashi" : "Takanashi") << endl;
    return 0;
}