#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;

int main() {
    int N; string S, X; cin >> N >> S >> X;
    
    vector<int> dp(7, 0);
    dp[0] = 1;

    for (int i = N - 1; i >= 0; i--) {
        int cur = S[i] - '0';
        vector<int> next(7, 0);
        if (X[i] == 'T') {
            REP(i, 0, 7) {
                if (dp[(10 * i) % 7] || dp[(10 * i + cur) % 7]) next[i] = 1;
            }
        } else {
            REP(i, 0, 7) {
                if (dp[(10 * i) % 7] && dp[(10 * i + cur) % 7]) next[i] = 1;
            }
        }
        dp = next;
    }
    if (dp[0]) cout << "Takahashi" << endl;
    else cout << "Aoki" << endl;
    return 0;
}

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

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll N;
    string c;
    cin >> N >> c;

    V<char> dec = {'B', 'R', 'W'};
    map<char, ll> mp;
    REP(i, 3) mp[dec[i]] = i;

    auto comb = [](ll x, ll y){
        ll res = 1;
        REP(i, y) res *= (x-i);
        REP(i, y) res /= (y-i);
        res %= 3;
        return res;
    };

    ll res = 0;
    REP(i, N){
        V<ll> p;
        ll tmp = N-1;
        while(tmp > 0){
            p.push_back(tmp%3);
            tmp /= 3;            
        }
        ll sz = p.size();
        V<ll> q;
        tmp = i;
        REP(j, sz){
            q.push_back(tmp%3);
            tmp /= 3;
        }

        ll v = 1;
        REP(j, sz){
            v *= comb(p[j], q[j]);
            v %= 3;
        }

        res += v * mp[c[i]];
        res %= 3;
    }

    if(N%2 == 0){
        cout << dec[(3-res)%3] << endl;
    }else{
        cout << dec[res] << endl;
    }

    return 0;
}