/// tban lecodes el bosta2
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x,y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;
const int N = 2e5+5, LG = 18, MOD = 1e9+7;
const long double PI = acos(-1);
const long double EPS = 1e-7;
bool vis[105][105][105];
pair<char, int> dp[105][105][105];
pair<char, int> solve(int x, int y, int z) {
    ///ABC
    if(!x + !y + !z >= 2) {
        if(x)return make_pair('A', x);
        if(y)return make_pair('B', y);
        if(z)return make_pair('C', z);
        return make_pair('D', 0);
    }
    if(vis[x][y][z])
        return dp[x][y][z];
    vis[x][y][z] = true;
    array<int, 3> sub; sub[0] = sub[1] = sub[2] = 0;
    if(x) {
        if(y >= z)sub[1] += 1;
        else sub[2] += 1;
    }
    if(y) {
        if(z >= x)sub[2] += 1;
        else sub[0] += 1;
    }
    if(z) {
        if(x >= y)sub[0] += 1;
        else sub[1] += 1;
    }
    return dp[x][y][z] = solve(x - sub[0], y - sub[1], z - sub[2]);
}
void doWork() {

//    f(i,1,6)
//    f(j,1,6)
//    f(k,1,6) {
//        if(max({i,j,k})-min({i,j,k})!=1)continue;
//        if(min({i,j,k}) != i+j+k-min({i,j,k})-max({i,j,k}))continue;
//        cout << i << ' ' << j << ' ' << k << '\n';
//        auto ans = solve(i,j,k);
//        cout << ans.F << ' ' << ans.S << '\n';
//    }

    ll A, B, C;
    cin >> A >> B >> C;
    vector<pair<ll, char>> vp({{A,'A'}, {B,'B'}, {C,'C'}});

    sort(all(vp));
    ///first iteration
    {
        ll x = min(vp[1].F - vp[0].F, (vp[2].F - vp[1].F) / 2);
        vp[1].F -= x;
        vp[2].F -= x * 2;

    }


    if(vp[0].F == vp[1].F) {
        ll lo = 0, hi = min(vp[1].F - 1, vp[2].F / 2);
        while(lo < hi) {
            ll md = lo + (hi-lo+1)/2;
            if(vp[1].F - md <= vp[2].F - md * 4)
                lo = md;
            else
                hi = md - 1;
        }
        vp[0].F -= lo;
        vp[1].F -= lo;
        vp[2].F -= lo * 4;

        if(vp[0].F == 1 && vp[2].F > 3) {
            vp[2].F -= 3;
            vp[0].F -= 1;
            vp[1].F -= 1;
        }

        if(vp[0].F == 0) {
            cout << vp.back().S << ' ' << vp.back().F << '\n';
            return;
        }
        ///vp[0]+2 >= vp[2]
        if(vp[0].F == vp[2].F || vp[0].F + 2 == vp[2].F) {
            cout << "Rubble!\n";
            return;
        }

        if(vp[2].F % 3 == 2) {
            cout << char((vp[2].S+vp[2].F + 1)%3 + 'A') << " 1\n";
        } else if(vp[2].F % 3 == 1) {
            cout << char((vp[2].S+vp[2].F)%3 + 'A') << " 1\n";
        }   else {
            cout << char((vp[2].S+vp[2].F + 2)%3 + 'A') << " 1\n";
        }

    }   else {
        cout << "Rubble!\n";
    }



}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}