#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fio() cin.tie(nullptr);ios::sync_with_stdio(false);
#define DEBUG_CTN(v) cerr<<#v<<":";for(auto itr=v.begin();itr!=v.end();itr++) cerr<<" "<<*itr; cerr<<endl
template<class T> bool chmax(T &a, const T &b) {if (a<b) { a = b; return true; } return false;}
template<class T> bool chmin(T &a, const T &b) {if (a>b) { a = b; return true; } return false;}
template<class T> void print(const T &t) { cout << t << "\n"; }
const ll INF = 1LL << 62;
const int iINF = 1 << 30;

int a[5],memo[14][14][14][14];

int win(){
    int& ret= memo[a[0]][a[1]][a[2]][a[3]];
    if(a[0]== 0 and a[1]==0 and a[2]==0 and a[3]==0) return 0;
    if(ret==-1){
        ret=0;
        rep(j,4){
            for(int i=1;i<=min(a[j],3);i++){
                a[j]-=i;
                if(win()==0)ret=1;
                a[j]+=i;
            }
        }
    }
    return ret;
}

int main() {
    fio(); cin>>a[0]>>a[1]>>a[2]>>a[3];
    memset(memo,0xff,sizeof(memo));
    if(win()) print("Taro");
    else print("Jiro");
}