#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------

ll S,P;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S>>P;
	for(ll a=1;a*a<=P;a++) if(P%a==0) {
		ll b=P/a;
		
		if(a+b==S) {
			cout<<"Yes"<<endl;
			return;
		}
		
	}
	cout<<"No"<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

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

typedef long long LL;

#define FOR(i,a,b) for(int _n(b),i(a);i<_n;i++) 
#define REP(i,n) FOR(i,0,n)

void setIO() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

const int MX = 200005;
int a[MX];
int n;
string s, x;
int M[MX][7];

int can(int p, int m) {
    if (p == n) return m == 0;

    int &r = M[p][m];
    if (r != -1) return r;
    
    // 0 
    int nm = (m*10)%7;
    int r1 = can(p+1, nm);

    // Si
    nm = (m*10+s[p]-'0')%7;
    int r2 = can(p+1, nm);

    if (x[p] == 'T') {
        return r = r1 || r2;
    }

    return r = r1 && r2;
}

int main() {
    setIO();
    cin>>n>>s>>x;
    memset(M, -1, sizeof M);
    cout << (can(0, 0) ? "Takahashi" : "Aoki") << "\n";
    return 0;
}
