#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll memo[20][20][20][20][100][100];

ll grundy(vector<ll> &n, vector<ll> &m) {
  ll &g = memo[n[0]][n[1]][n[2]][n[3]][m[0]][m[1]];
  if(g >= 0) return g;

  if(n[0] == 0 && n[1] == 0 && n[2] == 0 && n[3] == 0) {
    return m[0] > m[1];
  }

  set<ll> st;
  REP(i, 0, 4) {
    REP(j, 1, 4) {
      if(n[i] - j >= 0) {
        ll r;
        n[i] -= j; m[0] += j;
        if(n[i] == 0) {
          r = (m[1] + 1) / 2;
          m[0] += r;
          m[1] -= r;
        }
        swap(m[0], m[1]);
        st.insert(grundy(n, m));
        swap(m[0], m[1]);
        if(n[i] == 0) {
          m[0] -= r;
          m[1] += r;
        }
        n[i] += j; m[0] -= j;
      }
    }
  }

  g = 0;
  while(st.count(g)) g++;
  return g;
}

int main(void) {
  vector<ll> N(4);
  cin >> N[0] >> N[1] >> N[2] >> N[3];
  vector<ll> M(2, 0);

  REP(i, 0, 14) REP(j, 0, 14) REP(k, 0, 14) REP(l, 0, 14) REP(m, 0, 53) REP(n, 0, 53) memo[i][j][k][l][m][n] = -1;

  cout << (grundy(N, M) != 0 ? "Taro" : "Jiro") << endl;
}