#include <cstdio>
#include <algorithm>

int N[4];
int dp[14][14][14][14][53];
int sum;

int rec(int n1, int n2, int n3, int n4, int a){
    int b = sum - (n1 + n2 + n3 + n4 + a);
    if(n1 == 0 && n2 == 0 && n3 == 0 && n4 == 0){return a;}
    if(dp[n1][n2][n3][n4][a] != -1){return dp[n1][n2][n3][n4][a];}

    int res = 1001001001;
    for(int i=1;i<=3;i++){
        if(i <= n1){
            if(i == n1){res = std::min(res, rec(0, n2, n3, n4, b - (b+1) / 2));}
            else{res = std::min(res, rec(n1-i, n2, n3, n4, b));}
        }

        if(i <= n2){
            if(i == n2){res = std::min(res, rec(n1, 0, n3, n4, b - (b+1) / 2));}
            else{res = std::min(res, rec(n1, n2-i, n3, n4, b));}
        }

        if(i <= n3){
            if(i == n3){res = std::min(res, rec(n1, n2, 0, n4, b - (b+1) / 2));}
            else{res = std::min(res, rec(n1, n2, n3-i, n4, b));}
        }

        if(i <= n4){
            if(i == n4){res = std::min(res, rec(n1, n2, n3, 0, b - (b+1) / 2));}
            else{res = std::min(res, rec(n1, n2, n3, n4-i, b));}
        }
    }
    res = sum - res;

    return dp[n1][n2][n3][n4][a] = res;
}

int main(){
    for(int i=0;i<4;i++){scanf("%d", N+i); sum += N[i];}

    std::fill(&dp[0][0][0][0][0], &dp[0][0][0][0][0]+14*14*14*14*53, -1);

    if(rec(N[0], N[1], N[2], N[3], 0) >= (sum+1) / 2){
        puts("Taro");
    }else{
        puts("Jiro");
    }
    // printf("%d\n", rec(N[0], N[1], N[2], N[3], 0));
}