#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? -1 : 1,c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

inline int reads(char *s){
	int t = 0;
	register char c = getchar();
	while (c != 'D' && c != 'T' && c != '?') c = getchar();
	while (c == 'D' || c == 'T' || c == '?') s[++t] = c,c = getchar();
	return t;
}

const int N = 10;
char s[N];

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	int n = reads(s);
	int c0 = 0,c1 = 0;
	for (int i = 1;i <= n;i++){
		if (s[i] == 'T') ++c0;
		if (s[i] == 'D') ++c1;
		if (c0 >= 3) {puts("T1");return 0;}
		if (c1 >= 3) {puts("DRX");return 0;}
	}
	return 0;
}