#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i,x,n) for(int i=x; i<(n); ++i)
using ll = long long;
using P = pair<int, int>;
#define pai 3.1415926535897932384
#define INF 100100100
#define _GLIBCXX_DEBUG
#define All(a) (a).begin(),(a).end()
#define rAll(a) (a).rbegin(),(a).rend()

int main() {
    
    int A,C;
    char B,D;
    cin >> A >> B >> C >> D;
    if(A>C) {
        cout << "null" << endl;
    }
    else if(A<C) {
        cout << "tRue" << endl;
    }
    else {
        if(B == '0') {
            if(D == '2') {
                cout << "tRue" << endl;
                return 0;
            }
            if(D == '1') {
                cout << "null" << endl;
                return 0;
            }
            cout << "Draw" << endl;
            return 0;
        }
        if(B == '1') {
            if(D == '0') {
                cout << "tRue" << endl;
                return 0;
            }
            if(D == '2') {
                cout << "null" << endl;
                return 0;
            }
            cout << "Draw" << endl;
            return 0;
        }
        if(B == '2') {
            if(D == '0') {
                cout << "null" << endl;
                return 0;
            }
            if(D == '1') {
                cout << "tRue" << endl;
                return 0;
            }
            cout << "Draw" << endl;
            return 0;
        }
    }
 
}