#pragma comment(linker, "/STACK:16777216")
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <unordered_set>
#include <cstring>
#include <unordered_map>
#include "math.h"
#include <stdio.h>
#include <bitset>
#include <string>
#include <complex>
#include <iomanip>
#include <stack>
#include <deque>
#include <string>
#include<assert.h>
typedef long long ll;

using namespace std;
const ll MOD = 998244353;
const ll MAXN = 100005;
const double pi = acos(-1);

vector<int> g[100005];
int cnt[100005];

void solve() {
    string s;
    cin >> s;
    int cnt1 = 0;
    for (int i = 0; i < s.length(); i++) {
        if (s[i] == 'T')
            cnt1++;
    }
    if (cnt1 >= 3) {
        cout << "T1";
    } else {
        cout << "DRX";
    }
}


int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    cout.precision(20);
    //precalc();
    //freopen("../in.txt", "r", stdin);
    //freopen("../out.txt", "w", stdout);
    solve();
    return 0;
}