#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 N[4];
ll memo[14];

ll grundy(ll n) {
  ll &g = memo[n];
  if(g >= 0) return g;

  if(n == 0) return g = 0;

  set<ll> st;
  REP(i, 1, 4) if(n - i >= 0) st.insert(grundy(n - i));

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

int main(void) {
  cin >> N[0] >> N[1] >> N[2] >> N[3];

  REP(i, 0, 14) memo[i] = -1;

  ll g = grundy(N[0]) ^ grundy(N[1]) ^ grundy(N[2]) ^ grundy(N[3]);
  cout << (g != 0 ? "Taro" : "Jiro") << endl;
}