#include <stdio.h> #include <string> #include <cstring> #include <stdlib.h> #include <math.h> #include <algorithm> #include <vector> #include <set> #include <map> #include <queue> #include <stack> #include <list> #include <iterator> #include <assert.h> #pragma warning(disable:4996) typedef long long ll; #define MIN(a, b) ((a)>(b)? (b): (a)) #define MAX(a, b) ((a)<(b)? (b): (a)) #define LINF 9223300000000000000 #define INF 2140000000 const long long MOD = 1000000007; //const long long MOD = 998244353; using namespace std; int main(int argc, char* argv[]) { int n; scanf("%d", &n); vector<int> a(n),s(n+1); int i; for(i=0; i<n; i++) { scanf("%d", &a[i]); s[i+1]=s[i]^a[i]; } vector<int> g(n+1); int j; for(i=n-1; i>=0; i--) { set<int> z; for(j=0; j<=n; j++) z.insert(j); for(j=i+1; j<=n; j++) { int tmp=g[j]^s[j]^s[i]; z.erase(tmp); } auto it=z.begin(); g[i]=(*it); } if(g[0]) { printf("Takahashi\n"); } else { printf("Takanashi\n"); } return 0; }