from heapq import *
from collections import defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    n=int(input())
    aa=[int(input()) for _ in range(n)]
    grundy=[0]*(n+1)
    for i in range(n-1,-1,-1):
        hp=[]
        s=0
        for j in range(n-1,i-1,-1):
            s^=aa[j]
            heappush(hp,grundy[j]^s)
        g=-1
        while hp:
            ng=heappop(hp)
            if ng!=g+1:break
            g=ng
        grundy[i]=g+1
    if grundy[0]:print("Takahashi")
    else:print("Takanashi")
    #print(grundy)

main()