// clang-format off #include #define int long long #define main signed main() // #define main int main() #define bye return 0 #define loop(i, a, n) for (int i = (a); i < (n); i++) #define rep(i, n) loop(i, 0, n) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define prec(n) fixed << setprecision(n) #define stlice(from, to) substr(from, (to) - (from) + 1) #define min(...) min({__VA_ARGS__}) #define max(...) max({__VA_ARGS__}) #define pb push_back #define mp make_pair #define mt make_tuple #define fi first #define se second using namespace std; using pii = pair; using vi = vector; using vd = vector; using vvi = vector; using vc = vector; using vs = vector; using vpii = vector; template using fn = function; constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000; constexpr int MOD = 1000000007; constexpr double PI = acos(-1); constexpr int dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0}; template bool cmin(A &a, const B &b) { if (a > b) { a = b; return true; } else return false; } template bool cmax(A &a, const B &b) { if (a < b) { a = b; return true; } else return false; } namespace ftl { template constexpr V fmap(V v, const F &f) { transform(all(v), v.begin(), f); return v; } template constexpr V filterNot(V v, const F &f) { v.erase(remove_if(all(v), f), v.end()); return v; } template constexpr V filter(V v, const F &f) { return filterNot(v, [&](typename V::value_type x) { return !f(x); }); } template constexpr X fold(const X &x, const V &v, const F &f) { return accumulate(all(v), x, f); } template constexpr typename V::value_type sum(const V &v) { return accumulate(all(v), 0); } constexpr bool odd(const int &n) { return n & 1; } constexpr bool even(const int &n) { return !odd(n); } template constexpr bool andall(const V &v, const F &f) { bool b = true; for (auto &p : v) b &= f(p); return b; } template constexpr bool orany(const V &v, const F &f) { bool b = false; for (auto &p : v) b |= f(p); return b; } constexpr int gcd(int a, int b) { int c = 0; while (a) { c = a; a = b % a; b = c; } return b; } constexpr int pows(int a, int b) { int c = 1; while (b) { if (odd(b)) c *= a; b >>= 1; a *= a; } return c; } } using namespace ftl; // clang-format on main { vi t(2); rep(i, 3) { string a; cin >> a; t[a == "BLUE"]++; } cout << (t[0] > t[1] ? "RED" : "BLUE") << endl; bye; }