#include <iostream>
#include <algorithm>

using namespace std;

char cache[14][14][14][14][53][53];

int turn(const int cards[], int hand1, int hand2) {
	if ((cards[0] | cards[1] | cards[2] | cards[3]) == 0) {
		if (hand1 > hand2) {
			return 1;
		} else if (hand1 == hand2) {
			return 0;
		} else {
			return -1;
		}
	}
	int newCards[4];
	copy(&cards[0], &cards[3] + 1, &newCards[0]);
	sort(&newCards[0], &newCards[3] + 1);
	if (cache[newCards[0]][newCards[1]][newCards[2]][newCards[3]][hand1][hand2] != -2) {
		return cache[newCards[0]][newCards[1]][newCards[2]][newCards[3]][hand1][hand2];
	}
	int win = -1;
	for (int i = 0; i < 4 && win != 1; ++i) {
		for (int k = 1; k <= 3 && win != 1; ++k) {
			if (newCards[i] >= k) {
				newCards[i] -= k;
				int drawn;
				if (newCards[i] == 0) {
					drawn = (hand2 + 1) / 2;
				} else {
					drawn = 0;
				}
				win = turn(newCards, hand2 - drawn, hand1 + k + drawn) * -1;
				newCards[i] += k;
			}
		}
	}
	cache[newCards[0]][newCards[1]][newCards[2]][newCards[3]][hand1][hand2] = win;
	return win;
}

int main() {
	fill(&cache[0][0][0][0][0][0], &cache[13][13][13][13][52][52] + 1, -2);
	int n[4];
	cin >> n[0] >> n[1] >> n[2] >> n[3];
	int result = turn(n, 0, 0);
	cout << (result == 1 ? "Taro" : result == -1 ? "Jiro" : "Draw") << endl;
	return 0;
}