#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <map>
#include <tuple>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) y) { return (f)(begin(y), end(y), ## __VA_ARGS__); })(x)
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }

const int win  = 1;
const int draw = 0;
const int lose = -1;
int solve(array<int,4> n, int a, int b) {
whole(sort, n);
static map<tuple<array<int,4>, int, int>, int> memo;
auto key = make_tuple(n, a, b);
if (memo.count(key)) return memo[key];
int result = -2;
repeat (i,4) {
repeat_from (d, 1, min(3,n[i])+1) {
n[i] -= d;
int c = n[i] ? 0 : (b+1)/2;
setmax(result, - solve(n, b-c, a+d+c));
n[i] += d;
if (result == win) return memo[key] = win;
}
}
if (result == -2) {
result = a > b ? win : a < b ? lose : draw;
}
return memo[key] = result;
}
int main() {
array<int,4> n; cin >> n[0] >> n[1] >> n[2] >> n[3];
int ans = solve(n, 0, 0);
cout << (ans == win ? "Taro" : ans == lose ? "Jiro" : "Draw") << endl;
return 0;
}