#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int A[5],T;
int memo[14][14][14][14][53];

int win(int a,int b,int c,int d,int v) {
	int i,nv;
	int ev=T-a-b-c-d-v;
	if(a+b+c+d==0) {
		return v>=ev;
	}
	
	if(memo[a][b][c][d][v]==-1) {
		memo[a][b][c][d][v]=0;
		
		for(i=1;i<=min(a,3);i++) {
			if(i==a) {
				if(win(a-i,b,c,d,ev/2)==0) memo[a][b][c][d][v]=1;
			}
			else {
				if(win(a-i,b,c,d,ev)==0) memo[a][b][c][d][v]=1;
			}
		}
		for(i=1;i<=min(b,3);i++) {
			if(i==b) {
				if(win(a,b-i,c,d,ev/2)==0) memo[a][b][c][d][v]=1;
			}
			else {
				if(win(a,b-i,c,d,ev)==0) memo[a][b][c][d][v]=1;
			}
		}
		for(i=1;i<=min(c,3);i++) {
			if(i==c) {
				if(win(a,b,c-i,d,ev/2)==0) memo[a][b][c][d][v]=1;
			}
			else {
				if(win(a,b,c-i,d,ev)==0) memo[a][b][c][d][v]=1;
			}
		}
		for(i=1;i<=min(d,3);i++) {
			if(i==d) {
				if(win(a,b,c,d-i,ev/2)==0) memo[a][b][c][d][v]=1;
			}
			else {
				if(win(a,b,c,d-i,ev)==0) memo[a][b][c][d][v]=1;
			}
		}
	}
	return memo[a][b][c][d][v];
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	cin>>A[0]>>A[1]>>A[2]>>A[3];
	
	T=A[0]+A[1]+A[2]+A[3];
	MINUS(memo);
	if(win(A[0],A[1],A[2],A[3],0)) cout<<"Taro"<<endl;
	else cout<<"Jiro"<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}