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

#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>

#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
#define pqll priority_queue<ll>
#define pqllg priority_queue<ll, vector<ll>, greater<ll>>

constexpr ll INF = (1ll << 60);
//constexpr ll mod = 1000000007;
//constexpr ll mod = 998244353;

constexpr ll mod = 3;


constexpr double pi = 3.14159265358979323846;
template <typename T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
void pt(T val) {
    cout << val << "\n";
}
template <typename T>
void pt_vll(vector<T> &v) {
    ll vs = v.size();
    rep(i, vs) {
        cout << v[i];

        if (i == vs - 1)
            cout << "\n";
        else
            cout << " ";
    }
}
ll mypow(ll a, ll n) {
    ll ret = 1;
    if(n==0) return 1;
    if(a==0) return 0;
    rep(i, n) {
        if (ret > (ll)(1e18 + 10) / a) return -1;
        ret *= a;
    }
    return ret;
}
long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

const int MAX = 510000;
long long th[MAX], tw[MAX];
// テーブルを作る前処理
void COMinit() {
    th[1]=0; tw[1]=0;
    for (ll i = 2; i < MAX; i++){
        if(i%3==2) tw[i]=1;
        if(i%3==0){
            ll x=i;
            while(x%3==0){
                th[i]++;
                x/=3;
            }
            if(x%3==2) tw[i]=1;
        }
        tw[i]+=tw[i-1];
        th[i]+=th[i-1];
    }
}

// 二項係数計算
long long COM(ll n, ll k){
    if(th[n]>th[k]+th[n-k]) return 0;
    if((tw[n]-tw[k]-tw[n-k])%2==0) return 1;
    return 2;
}

int main() {
    ll n,m,k,sum=0,ans=0;
    string s;
    cin>>n>>s;
    COMinit();
    vll a(n);
    rep(i,n){
        if(s[i]=='W') a[i]=0;
        if(s[i]=='B') a[i]=1;
        if(s[i]=='R') a[i]=2;
        a[i]*=COM(n-1,i);
    }
    rep(i,n){
        sum+=a[i];
        sum%=mod;
    }
    if(n%2==0) sum=(3-sum)%3;
    if(sum%3==0) cout<<"W"<<endl;
    if(sum%3==1) cout<<"B"<<endl;
    if(sum%3==2) cout<<"R"<<endl;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 2005;

char s[N][N];
int f[N][N];
int cal(char c) {
    return c == '+' ? 1 : -1;
}
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> s[i] + 1;
    }
    for (int i = n; i >= 1; i--) {
        for (int j = m; j >= 1; j--) {
            if (i < n && j < m)
                f[i][j] = max(cal(s[i][j + 1]) - f[i][j + 1], cal(s[i + 1][j]) - f[i + 1][j]);
            else if (i < n) {
                f[i][j] = cal(s[i + 1][j]) - f[i + 1][j];
            } else if (j < m) {
                f[i][j] = cal(s[i][j + 1]) - f[i][j + 1];
            } else {
                f[i][j] = 0;
            }
        }
    }
    if (f[1][1] == 0)
        puts("Draw");
    else if (f[1][1] > 0)
        puts("Takahashi");
    else
        puts("Aoki");
    return 0;
}
