#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
struct UnionFind {
    vector<int> par;
    vector<int> rank;
    vector<ll> Size;
    UnionFind(int n = 1) {
        init(n);
    }

    void init(int n = 1) {
        par.resize(n + 1); rank.resize(n + 1); Size.resize(n + 1);
        for (int i = 0; i <= n; ++i) par[i] = i, rank[i] = 0, Size[i] = 1;
    }

    int root(int x) {
        if (par[x] == x) {
            return x;
        }
        else {
            int r = root(par[x]);
            return par[x] = r;
        }
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (rank[x] < rank[y]) swap(x, y);
        if (rank[x] == rank[y]) ++rank[x];
        par[y] = x;
        Size[x] += Size[y];
        return true;
    }

    ll size(int x){
        return Size[root(x)];
    }
};

int N;
int M;
string S[1000];

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    UnionFind uni(N);
    for(int i = 0; i < N; i++) {
        cin >> S[i];
        for(int j = i + 1; j < N; j++) {
            if(S[i][j] == 'Y') {
                uni.merge(i, j);
                M++;
            }
        }
    }
    if(N % 2 == 1) {
        int oddness = (N - 1) * (N - 2) / 2;
        if(oddness % 2 == M % 2) {
            cout << "Hanako" << endl;
        } else {
            cout << "Taro" << endl;
        }
        return 0;
    } else {
        bool TaroDeleteOdd = true;
        int oddness = (N - 1) * (N - 2) / 2;
        if(oddness % 2 == M % 2) {
            TaroDeleteOdd = true;
        } else {
            TaroDeleteOdd = false;
        }
        int even = 0;
        int odd = 0;
        for(int i = 0; i < N; i++) {
            if(uni.root(i) != i) continue;
            if(uni.size(i) % 2 == 1) odd++;
            else even++;
        }
        //cerr << oddness << " " << M << endl;
        //cerr << TaroDeleteOdd << " " << even << " " << odd << endl;
        if(TaroDeleteOdd) {
            for(int i = 0; ; i++) {
                if((odd + even) == 2) break;
                if(odd >= 2) {
                    odd -= 2;
                    even++;
                } else {
                    even--;
                }
                if((odd + even) == 2) break;
                if(even >= 1) even--;
                else {
                    odd -= 2;
                    even++;
                }
            }
            //cerr << odd << " " << even << endl;
            if(odd == 2) {
                cout << "Hanako" << endl;
            } else {
                cout << "Taro" << endl;
            }
        } else {
            for(int i = 0; ; i++) {
                if((odd + even) == 2) break;
                if(even >= 1) even--;
                else {
                    odd -= 2;
                    even++;
                }
                if((odd + even) == 2) break;
                if(odd >= 2) {
                    odd -= 2;
                    even++;
                } else {
                    even--;
                }
            }
            if(odd == 2) {
                cout << "Taro" << endl;
            } else {
                cout << "Hanako" << endl;
            }
        }
    }
    return 0;
}


Measured memory_bytes: 4132