N = list(map(int, input().split()))

def f(N, taro, jiro, t):
    ret = 0
    for n in N:
        ret *= 14
        ret += n
    ret *= 53
    ret += taro
    ret *= 53
    ret += jiro
    ret *= 2
    ret += t
    return ret


memo = {}
def solve(N, taro, jiro, t):
    if sum(N) == 0:
        if taro > jiro:
            return 1
        elif taro == jiro:
            return 0
        else:
            return -1
    tup = f(N, taro, jiro, t)
    if tup in memo:
        return memo[tup]

    if t == 0:
        ret = -1
        for i in range(4):
            for j in range(1, 4):
                if N[i] < j:
                    break
                elif N[i] == j:
                    N[i] = 0
                    ret = max(ret, solve(N, taro + j + (jiro + 1) // 2, jiro // 2, 1))
                    N[i] = j
                else:
                    N[i] -= j
                    ret = max(ret, solve(N, taro + j, jiro, 1))
                    N[i] += j
                if ret == 1:
                    memo[tup] = ret
                    return ret
    else:
        ret = 1
        for i in range(4):
            for j in range(1, 4):
                if N[i] < j:
                    break
                elif N[i] == j:
                    N[i] = 0
                    ret = min(ret, solve(N, taro // 2, jiro + j + (taro + 1) // 2, 0))
                    N[i] = j
                else:
                    N[i] -= j
                    ret = min(ret, solve(N, taro, jiro + j, 0))
                    N[i] += j
                if ret == -1:
                    memo[tup] = ret
                    return ret
    memo[tup] = ret
    return ret

    
ans = solve(N, 0, 0, 0)
if ans == 1:
    print("Taro")
elif ans == -1:
    print("Jiro")
else:
    print("Draw")