/* -*- coding: utf-8 -*-
 *
 * 102.cc: No.102 トランプを奪え - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 13;

/* typedef */

/* global variables */

bool dp[MAX_N + 1][MAX_N + 1][MAX_N + 1][MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n0, n1, n2, n3;
  cin >> n0 >> n1 >> n2 >> n3;

  for (int i0 = 0; i0 <= n0; i0++)
    for (int i1 = 0; i1 <= n1; i1++)
      for (int i2 = 0; i2 <= n2; i2++)
	for (int i3 = 0; i3 <= n3; i3++) {
	  if (i0 == 0 && i1 == 0 && i2 == 0 && i3 == 0)
	    dp[i0][i1][i2][i3] = true;
	  else {
	    bool loose = true;
	    for (int j0 = i0 - 1; loose && j0 >= 0 && j0 >= i0 - 3; j0--)
	      if (dp[j0][i1][i2][i3]) loose = false;
	    for (int j1 = i1 - 1; loose && j1 >= 0 && j1 >= i1 - 3; j1--)
	      if (dp[i0][j1][i2][i3]) loose = false;
	    for (int j2 = i2 - 1; loose && j2 >= 0 && j2 >= i2 - 3; j2--)
	      if (dp[i0][i1][j2][i3]) loose = false;
	    for (int j3 = i3 - 1; loose && j3 >= 0 && j3 >= i3 - 3; j3--)
	      if (dp[i0][i1][i2][j3]) loose = false;
	    dp[i0][i1][i2][i3] = loose;
	  }
	  //printf("dp[%d][%d][%d][%d]=%d\n", i0, i1, i2, i3, dp[i0][i1][i2][i3]);
	}

  cout << (dp[n0][n1][n2][n3] ? "Jiro" : "Taro") << endl;
  return 0;
}