#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    int n; cin>>n;
    int a[2020];
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    vector<int> s(n+1);
    for(int i=0; i<n; i++) s[i+1]=s[i]^a[i];
    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());
    if(s.size()<n+1) cout<<"Takahashi"<<endl;
    else cout<<"Takanashi"<<endl;
    return 0;
}