/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());

class hakohakohako {
public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      int n; cin >> n;
      vector<int> a(n);
      rep(i, n) {
        cin >> a[i];
      }

      vector<bool> dp(n+1);
      dp[0] = true;
      for(int i=1; i<=n; i++) {
        vector<int> b;
        for(int j=n-i; j<n; j++) {
          b.push_back(a[j]);
        }
        int k = b.size();
        if (k==1) {
          dp[1] = false;
          continue;
        }
        int p = 0;
        rep(j, k) {
          p ^= b[j];
          debug(i, k, j, b[j], p);
          if (p==0) {
            dp[k] = dp[k] || dp[k-j-1];
          }
        }
      }

      string s;
      if (dp[n]) {
        s = "Takahashi";
      } else {
        s = "Takanashi";
      }
      cout << s << endl;
    }
};

signed main() {
  hakohakohako solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}