#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int dp[14][14][14][14][53];
int n;

int dfs(int a, int b, int c, int d, int m){
    if(dp[a][b][c][d][m] != -1) return dp[a][b][c][d][m];

    if(a==0&&b==0&&c==0&&d==0){
        dp[a][b][c][d][m] = m;
        return dp[a][b][c][d][m];
    }

    int w = n - a - b - c - d - m;
    int g = (w+1)/2;
    int minw = 100;
    srep(i,1,min(4,a+1)){
        if(i == a){
            minw = min(minw, dfs(a-i,b,c,d,w-g));
        }else{
            minw = min(minw, dfs(a-i,b,c,d,w));
        }
    }
    srep(i,1,min(4,b+1)){
        if(i == b){
            minw = min(minw, dfs(a,b-i,c,d,w-g));
        }else{
            minw = min(minw, dfs(a,b-i,c,d,w));
        }
    }
    srep(i,1,min(4,c+1)){
        if(i == c){
            minw = min(minw, dfs(a,b,c-i,d,w-g));
        }else{
            minw = min(minw, dfs(a,b,c-i,d,w));
        }
    }
    srep(i,1,min(4,d+1)){
        if(i == d){
            minw = min(minw, dfs(a,b,c,d-i,w-g));
        }else{
            minw = min(minw, dfs(a,b,c,d-i,w));
        }
    }

    dp[a][b][c][d][m] = n - minw;
    return dp[a][b][c][d][m];
}

int main() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    n = a + b + c + d;

    rep(i,14){
        rep(j,14){
            rep(k,14){
                rep(l,14){
                    rep(mm,53){
                        dp[i][j][k][l][mm] = -1;
                    }
                }
            }
        }
    }

    int ans = dfs(a,b,c,d,0);
    // cout << ans << endl;

    if(n % 2 == 0 && ans == n / 2){
        cout << "Draw" << endl;
    }else if(ans > n - ans){
        cout << "Taro" << endl;
    }else{
        cout << "Jiro" << endl;
    }

    return 0;
}