#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n[4];
bool memo[14][14][14][14][14*4][14*4][2];
bool used[14][14][14][14][14*4][14*4][2];
bool draw[14][14][14][14][14*4][14*4][2];
vector<int> vec(4), num(2);

int rec(bool f);

int calc(bool f) {
    int res = !f;
    for (int i = 0; i < 4; i++) {
        for (int j = 1; j <= 3; j++) {
            if (vec[i] == j) {
                int r = num[!f] / 2 + (num[!f]%2);
                vec[i] = 0;
                num[f] += j + r;
                num[!f] -= r;
                int ret = rec(!f);
                if (ret == f) {
                    vec[i] = j;
                    num[f] -= (j + r);
                    num[!f] += r;
                    return f;
                }
                if (ret == 2) res = 2;
                vec[i] = j;
                num[f] -= (j + r);
                num[!f] += r;
            } else if (vec[i] > j) {
                vec[i] -= j;
                num[f] += j;
                int ret = rec(!f);
                if (ret == f) {
                    vec[i] += j;
                    num[f] -= j;
                    return f;
                }
                if (ret == 2) res = 2;
                vec[i] += j;
                num[f] -= j;
            }
        }
    }
    return res;
}

int rec(bool f) {
    if (!used[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f]) {
        if (vec[0] == 0 && vec[1] == 0 && vec[2] == 0 && vec[3] == 0) {
            if (num[0] == num[1]) draw[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f] = true;
            else memo[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f] = (num[0] < num[1]);
        } else {
            int ret = calc(f);
            if (ret == 2) draw[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f] = true;
            else memo[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f] = ret;
        }
        used[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f] = true;
    }
    return (draw[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f]?2:memo[vec[0]][vec[1]][vec[2]][vec[3]][num[0]][num[1]][f]);
}

string solve() {
    for (int i = 0; i < 4; i++) vec[i] = n[i];
    int res = rec(0);
    switch(res) {
    case 0: return "Taro";
    case 1: return "Jiro";
    default: return "Draw";
    }
}

void input() {
    for (int i = 0; i < 4; i++) cin >> n[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}