import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[][][][][] cache;

int calc(int[4] a, int x, int y) {
  if (cache[a[0]][a[1]][a[2]][a[3]][x] == -2) {
    int ret;
    if (a[0] == 0 && a[1] == 0 && a[2] == 0 && a[3] == 0) {
      ret = sgn(x - y);
    } else {
      ret = -2;
      foreach (i; 0 .. 4) {
        foreach (k; 1 .. 4) {
          if (a[i] >= k) {
            int[4] aa = a.dup;
            int xx = x, yy = y;
            aa[i] -= k;
            xx += k;
            if (aa[i] == 0) {
              xx += (yy + 1) / 2;
              yy -= (yy + 1) / 2;
            }
            chmax(ret, -calc(aa, yy, xx));
          }
        }
      }
      assert(ret != -2);
    }
    cache[a[0]][a[1]][a[2]][a[3]][x] = ret;
  }
  return cache[a[0]][a[1]][a[2]][a[3]][x];
}

void main() {
  try {
    for (; ; ) {
      int[4] N;
      foreach (i; 0 .. 4) {
        N[i] = readInt();
      }
      cache = new int[][][][][](14, 14, 14, 14, 53);
      foreach (a0; 0 .. 14)
      foreach (a1; 0 .. 14)
      foreach (a2; 0 .. 14)
      foreach (a3; 0 .. 14)
      foreach (x; 0 .. 53)
      {
        cache[a0][a1][a2][a3][x] = -2;
      }
      const ans = calc(N, 0, 0);
      writeln((ans > 0) ? "Taro" : (ans < 0) ? "Jiro" : "Draw");
    }
  } catch (EOFException e) {
  }
}