// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

vector<int> n;
int N = 0;

struct state{
  vector<int> n = vector<int>(4, 0);
  int h = 0;
  state(vector<int> &v){
    rep(i, 4)n[i] = v[i];
  }
  bool operator<(const state &r) const{
    rep(i, 4)if(n[i] != r.n[i])return n[i] < r.n[i];
    return h < r.h;
  }
};

map<state, int> mp;

int calc(state &s){
  if(mp.find(s) != mp.end())return mp[s];
  int res = 0;
  int v = N - s.h;
  rep(i, 4)v -= s.n[i];
  FOR(k, 1, 4){
    rep(i, 4){
      if(s.n[i] > k){
        int ans = k + s.h;
        state t = s;
        t.n[i] -= k;
        t.h = v;
        int tmp = calc(t);
        rep(j, 4)ans += t.n[j];
        ans -= tmp;
        res = max(res, ans);
      }else if(s.n[i] == k){
        state t = s;
        t.n[i] -= k;
        t.h = v - (v + 1) / 2;
        int ans = k + s.h + (v + 1) / 2;
        int tmp = calc(t);
        rep(j, 4)ans += t.n[j];
        ans -= tmp;
        res = max(res, ans);
      }
    }
  }
  return mp[s] = res;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  n.resize(4, 0);
  rep(i, 4)cin >> n[i];
  rep(i, 4)N += n[i];
  state s = state(n);
  int ans = calc(s);
  if(ans > N - ans)cout << "Taro" << endl;
  else if(ans < N - ans)cout << "Jiro" << endl;
  else cout << "Draw" << endl;
	return 0;
}