#include<iostream>
using namespace std;
int N,A[2000],S[2001];
int dp[2020];
int onec[2001];
bool dfs(int u)
{
	if(u==N)return false;
	if(dp[u]!=0)return dp[u]==1;
	for(int v=u+1;v<=N;v++)
	{
		if((S[v]^S[u])==0)
		{
			if(!dfs(v))
			{
				dp[u]=1;
				return true;
			}
		}
		else if(onec[v]-onec[u]==v-u)
		{
			if(dfs(v))
			{
				dp[u]=1;
				return true;
			}
		}
	}
	dp[u]=-1;
	return false;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		S[i+1]=S[i]^A[i];
		onec[i+1]=onec[i]+(A[i]==1);
	}
	cout<<"Taka"<<(dfs(0)?"h":"n")<<"ashi"<<endl;
}