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

# Compute prefix xor sums (1-based)
xor_sum = [0] * (n + 1)
for i in range(1, n+1):
    xor_sum[i] = xor_sum[i-1] ^ A[i-1]

# Initialize DP array
G = [0] * (n + 2)  # G[1..n+1]

for i in range(n, 0, -1):
    s = set()
    max_k = n - i + 1
    for k in range(1, max_k + 1):
        j = i + k - 1
        y = xor_sum[j] ^ xor_sum[i-1]
        next_i = i + k
        g_next = G[next_i]
        val = y ^ g_next
        s.add(val)
    mex = 0
    while mex in s:
        mex += 1
    G[i] = mex

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