#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){
		to = a, cost = b;
	}
};

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i<vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
    cout << head;
    if(sizeof...(Tail) > 0) cout << " ";
    dump_func(std::move(tail)...);
}

ll n;
string s, x;
ll dp[200005][7];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> s >> x;
	s = "#" + s, x = "#" + x;
	
	dp[n][0] = 1;
	rep(i, 1, 6) dp[n][i] = -1;
	
	for(int i = n-1; i >= 0; i--){
		rep(j, 0, 6){
			if(x[i+1] == 'T') dp[i][j] = max(dp[i+1][j*10%7], dp[i+1][(j*10+s[i+1]-'0')%7]);
			if(x[i+1] == 'A') dp[i][j] = min(dp[i+1][j*10%7], dp[i+1][(j*10+s[i+1]-'0')%7]);
		}
	}
	
	if(dp[0][0] > 0) outl("Takahashi");
	if(dp[0][0] < 0) outl("Aoki");
	
	return 0;
}
#include <bits/stdc++.h>

using namespace std;

int N;
string digit, turn;
int dp[100001][7];
bool calc(int index, int rem) {
    if (index == N) {
        return rem == 0;
    }
    int &retVal = dp[index][rem];
    if (retVal != -1)
        return retVal;
    if (turn[index]) {
        retVal = calc(index + 1, (10 * rem) % 7);
        retVal |= calc(index + 1, (10 * rem + digit[index]) % 7);
    }
    else {
        retVal = calc(index + 1, (10 * rem) % 7);
        retVal &= calc(index + 1, (10 * rem + digit[index]) % 7);
    }
    return retVal;
}

int main() {
    memset(dp, -1, sizeof(dp));
    cin >> N;
    cin >> digit >> turn;
    for (int x = 0; x < N; x++)
    {
        digit[x] -= '0';
        turn[x] = turn[x] == 'T';
    }
    cout << (calc(0, 0) ? "Takahashi" : "Aoki");

}