#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--)
#define debug(x) cout << #x << ": " << x << endl
#define mp make_pair
#define pb push_back
const ll MOD = 1000000007;
const int INF = 1e9;
const ll LINF = 1e16;
const double PI = acos(-1.0);
int dx[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };
int dy[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  xtimex  Problem: yukicoder102  / Link: https://yukicoder.me/problems/no/102  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

vector<int> n(4, 0);
int a[14][14][14][14];

int f() {
	int& ret = a[n[0]][n[1]][n[2]][n[3]];
	if (accumulate(n.begin(), n.end(), 0) == 0) return 0;

	if (ret != -1)return ret;
	ret = 0;
	FOR(j, 0, 4) {
		FOR(i, 1, min(n[j], 3) + 1) {
			n[j] -= i;
			if (f() == 0)ret = 1;
			n[j] += i;
		}
	}
	return ret;
}

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

	FOR(i, 0, 4)cin >> n[i];
	FOR(i, 0, 14)FOR(j, 0, 14)FOR(k, 0, 14)FOR(l, 0, 14)a[i][j][k][l] = -1;

	if (f())cout << "Taro" << "\n";
	else cout << "Jiro" << "\n";

	return 0;
}