#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) for (int i=0;i<(n);i++) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) #define inf 0x3f3f3f3f #define INF INT_MAX/3 #define PB push_back #define MP make_pair #define ALL(a) (a).begin(),(a).end() #define SET(a,c) memset(a,c,sizeof a) #define CLR(a) memset(a,0,sizeof a) #define pii pair #define pcc pair #define pic pair #define pci pair #define VS vector #define VI vector #define DEBUG(x) cout<<#x<<": "<b?b:a) #define MAX(a,b) (a>b?a:b) #define pi 2*acos(0.0) #define INFILE() freopen("in0.txt","r",stdin) #define OUTFILE()freopen("out0.txt","w",stdout) #define ll long long #define ull unsigned long long #define eps 1e-14 #define FST first #define SEC second #define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15) namespace { struct input_returnner { int N; input_returnner(int N_ = 0) :N(N_) {} template operator vector() const { vector res(N); for (auto &a : res) cin >> a; return std::move(res); } template operator T() const { T res; cin >> res; return res; } template T operator - (T right) { return T(input_returnner()) - right; } template T operator + (T right) { return T(input_returnner()) + right; } template T operator * (T right) { return T(input_returnner()) * right; } template T operator / (T right) { return T(input_returnner()) / right; } template T operator << (T right) { return T(input_returnner()) << right; } template T operator >> (T right) { return T(input_returnner()) >> right; } }; template input_returnner in() { return in(); } input_returnner in() { return input_returnner(); } input_returnner in(int N) { return std::move(input_returnner(N)); } } void solve(); /// ---template--- signed main(void) { SETUP; solve(); return 0; } void solve() { vector N = in(4); int maxn = *max_element(ALL(N)); vector grundy(maxn + 1); REP(i, maxn) { set s; REP(j, 3 + 1) if (i - j >= 0) s.insert(grundy[i - j]); int g = 0; while (s.count(g) != 0) ++g; grundy[i] = g; } int ans = 0; for (auto &a : N) ans ^= a; cout << (ans != 0 ? "Taro" : "Jiro") << endl; }