#include <bits/stdc++.h>
using namespace std;

#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define all(v) v.begin(),v.end()

template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }

class Solver {
  public:
    bool solve() {
        vector<int> N(4); cin >> N;

        int grundy = 0;
        rep(k, 4) {
            vector<int> g(N[k]);
            rep(i, g.size()) {
                set<int> num;
                for(int j = max(0, i - 3); j < i; j++) num.insert(g[j]);
                int mex = 0;
                for(auto gg : num) {
                    if(gg == mex) mex++;
                }
                g[i] = mex;
            }
            grundy ^= g.back();
        }
        cout << (grundy != 0 ? "Taro" : "Jiro") << endl;
        
        
        return 0;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Solver s;
    s.solve();
    return 0;
}