n = int(input())
A = [int(input()) for _ in range(n)]

pre_xor = [0] * (n + 1)
for i in range(n):
    pre_xor[i + 1] = pre_xor[i] ^ A[i]

g = [0] * (n + 2)
g[n + 1] = 0  # Base case: no unopened boxes left

for i in range(n, 0, -1):
    s = set()
    max_k = n - i + 1
    for k in range(1, max_k + 1):
        next_i = i + k
        current_xor = pre_xor[i - 1 + k] ^ pre_xor[i - 1]
        total = current_xor ^ g[next_i]
        s.add(total)
    mex = 0
    while mex in s:
        mex += 1
    g[i] = mex

print("Takahashi" if g[1] != 0 else "Takanashi")