#include <bits/stdc++.h>

using namespace std;

int dp[14][14][14][14][57][57];

int solve(int x, int y, int z, int w, int me, int you, int all) {
  if (dp[x][y][z][w][me][you] != -1)
    return dp[x][y][z][w][me][you];

  if (x + y + z + w == 0)
    return me;
  int ret = 0;
  
  for (int i = 1; i <= 3 && x >= i; i++) {
    if (i == x)
      ret = max(ret, all-solve(x-i, y, z, w, you/2, me+i+you-you/2, all));
    else
      ret = max(ret, all-solve(x-i, y, z, w, you, me+i, all));
  }

  for (int i = 1; i <= 3 && y >= i; i++) {
    if (i == y)
      ret = max(ret, all-solve(x, y-i, z, w, you/2, me+i+you-you/2, all));
    else
      ret = max(ret, all-solve(x, y-i, z, w, you, me+i, all));
  }

  for (int i = 1; i <= 3 && z >= i; i++) {
    if (i == z)
      ret = max(ret, all-solve(x, y, z-i, w, you/2, me+i+you-you/2, all));
    else
      ret = max(ret, all-solve(x, y, z-i, w, you, me+i, all));
  }

  for (int i = 1; i <= 3 && w >= i; i++) {
    if (i == w)
      ret = max(ret, all-solve(x, y, z, w-i, you/2, me+i+you-you/2, all));
    else
      ret = max(ret, all-solve(x, y, z, w-i, you, me+i, all));
  }

  return dp[x][y][z][w][me][you] = ret;
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  memset(dp, -1, sizeof(dp));
  
  int x, y, z, w;
  cin >> x >> y >> z >> w;

  int me = solve(x, y, z, w, 0, 0, x+y+z+w);
  int you = x + y + z + w - me;
  if (me > you)
    cout << "Taro" << endl;
  else if (you > me)
    cout << "Jiro" << endl;
  else
    cout << "Draw" << endl;
  
  return 0;
}