#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename T>
void bu(vector<T> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void bu(int a) { cout << a << endl; }
void bu(int a, int b) { cout << a << ' ' << b << endl; }
void bu(int a, int b, int c) { cout << a << ' ' << b << ' ' << c << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;

//--------------------------------------------------------------------------------
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;

//--------------------------------------------------------------------------------

signed main() {
    kuaidu();
    T = 1;
    while (T--) {
        string s; cin >> s;
        int l1 = 0, l2 = 0;
        for (auto x : s) {
            if (x == 'T') l1++;
            else if(x=='D') l2++;
        }
        if (l1 >= 3) {
            cout << "T1" << endl;
        }
        else {
            cout << "DRX" << endl;
        }

    }
    return 0;
}