#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 3e5 + 5, M = 105;
const ld PI = acos(-1.0), EPS = 1e-9;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll a, b, c, nxt[3], idx[3];
pair<ll, ll> p[3];
string s = "ABC";

bool ok(ll mid) {
    a = p[0].first, b = p[1].first - mid, c = p[2].first - mid * 2;
    if (b < a || c < b) return 0;
    return 1;
}

bool ok2(ll mid) {
    ll r[3];
    r[0] = p[0].first - mid / 2, r[1] = p[1].first - mid / 2, r[2] = p[2].first - mid * 2;
    if (!r[0]) r[2]++;
    if (mid & 1) r[idx[nxt[p[2].second]]]--;
    if (r[2] < max(r[0], r[1]) || min({r[0], r[1], r[2]}) < 0) return 0;
    return 1;
}

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    for (int i = 0; i < 3; i++) cin >> p[i].first, p[i].second = i, nxt[i] = i + 1;
    nxt[2] = 0;
    sort(p, p + 3);
    for (int i = 0; i < 3; i++) idx[p[i].second] = i;
    ll l = 1, r = oo, mid, ans = 0;
    while (l <= r) {
        mid = (l + r) >> 1;
        if (ok(mid)) ans = mid, l = mid + 1;
        else r = mid - 1;
    }
    p[1].first -= ans, p[2].first -= ans * 2;
    //cout << p[0].first << " " << p[1].first << " " << p[2].first << endl;
    if (p[1].first == p[2].first) {
        ll num = (p[1].first - p[0].first) / 3;
        p[1].first -= num * 3;
        p[2].first -= num * 3;
        if (p[1].first - p[0].first == 2) {
            p[1].first--, p[2].first--;
            p[idx[nxt[p[0].second]]].first--;
        }
    } else if (p[1].first == p[0].first) {
        ll l = 1, r = oo, mid, ans = 0;
        while (l <= r) {
            mid = (l + r) >> 1;
            if (ok2(mid)) ans = mid, l = mid + 1;
            else r = mid - 1;
        }
        //cout << ans << endl;
        p[0].first -= ans / 2, p[1].first -= ans / 2, p[2].first -= ans * 2;
        if (!p[0].first) p[2].first++;
        if (ans & 1) p[idx[nxt[p[2].second]]].first--;
    }
    sort(p, p + 3);
    //for (int i = 0; i < 3; i++) cout << p[i].first << " " << p[i].second << endl;
    //cout << endl;
    if (p[1].first == p[2].first) cout << "Rubble!";
    else if (p[1].first == 0) cout << s[p[2].second] << " " << p[2].first;
    else cout << s[(p[2].second - p[2].first + 1 + oo * 3) % 3] << " " << 1;
    return 0;
}