#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pll pair<ll, ll>

pll in[3];

bool cmp(pll a, pll b)
{
    return a.first > b.first;
}

int main()
{
    for (ll i = 0; i < 3; i++)
    {
        ll x;
        scanf("%lld", &x);
        in[i] = make_pair(x, i);
    }
    sort(in, in + 3, cmp);
    if (in[0].first >= in[1].first * 2 + in[2].first * 2)
    {
        printf("%c %d\n", in[0].second + 'A', in[0].first + 1 - in[1].first * 2 - in[2].first * 2);
        return 0;
    }

    ll x = in[0].first - 2 * in[1].first + in[2].first;
    if ((x % 3 + 3) % 3 == 0 || (x % 3 + 3) % 3 == 2)
    {
        puts("Rubble!");
    }
    else
    {
        if (x > 0)
        {
            in[0].first -= (in[1].first - in[2].first) * 2;
            in[1].first = in[2].first;
            ll ans = ((x - 1) / 3 + 2 * in[0].first + in[0].second + 1) % 3;
            printf("%c %d\n", ans + 'A', 1);
        }
        else
        {
            ll ans = (2 * in[2].first + in[2].second + 2) % 3;
            printf("%c %d\n", ans + 'A', 1);
        }
        // printf("%lld\n", (abs((x - 1) / 3) + 2 * in[0].first + in[0].second + 1));
    }
    return 0;
}