#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007

struct UnionFind{
  vector<int> v;
  UnionFind(int n) : v(n, -1) {}
  void init(){ for(int i = 0;i < v.size();i++)v[i]=-1; }
  int find(int x) { return v[x] < 0 ? x : v[x] = find(v[x]); }
  bool unite(int x, int y) {
    x = find(x); y = find(y);
    if (x == y) return false;
    if (-v[x] < -v[y]) swap(x, y);
    v[x] += v[y]; v[y] = x;
    return true;
  }
  bool root(int x) { return v[x] < 0; }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return -v[find(x)]; }
};

int N;
string s[1001];
int dp[1001][1001][2];

int dfs(int com,int ecom,int pari){
  if(dp[com][ecom][pari]!=-1)return dp[com][ecom][pari];
  if(com==1)return 1;
  int res=0;
  if(pari&&dfs(com,ecom,0)==0)res=1;
  rep(e1,2)rep(e2,2){
    if(ecom<e1+e2)continue;
    if(e1==0&&e2==0&&(com-ecom)>=2){
      if(dfs(com-1,ecom+1,pari)==0)res=1;
    }else if((e1==0||e2==0)&&(com-ecom)>=1){
      if(dfs(com-1,ecom-1,1-pari)==0)res=1;
    }else{
      if(dfs(com-1,ecom-1,1-pari)==0)res=1;
    }
  }
  return dp[com][ecom][pari]=res;
}

int main(){
  cin>>N;
  rep(i,N)cin>>s[i];
  UnionFind uf(N);
  rep(i,N)rep(j,i){
    if(s[i][j]=='Y')uf.unite(i,j);
  }
  int com=0,ecom=0,pari=0;
  vector<bool> used(N,false);
  rep(i,N){
    if(used[uf.find(i)])continue;
    used[uf.find(i)]=true;
    com++;
    int sz=uf.size(i);
    int ecnt=0;
    vector<int> vs;
    rep(j,N){
      if(!uf.same(i,j))continue;
      vs.push_back(j);
    }
    for(int v1 : vs){
      for(int v2 : vs){
        if(s[v1][v2]=='Y')ecnt++;
      }
    }
    ecnt/=2;
    if(sz%2==0)ecom++;
    if(((sz*(sz-1)/2)-ecnt)%2==1)pari=1-pari;
  }
  memset(dp,-1,sizeof(dp));
  if(dfs(com,ecom,pari))cout<<"Taro"<<endl;
  else cout<<"Hanako"<<endl;
  return 0;
}

