#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
using namespace std;

struct FORT{
    LL v;
    FORT * t;
    char c;
    int r;
    FORT(){r=0;}
}_a[3];

FORT * a[3];
bool cmp(FORT *x,FORT *y)
{
    return (x->v) > (y->v);
}

void A_throw()
{
    for(int i=0;i<3;i++)
    {
        if(!a[i]->v)continue;
        int u = (i+1)%3 , v= (i+2)%3;
        if(a[u]->v > a[v]->v)
            a[u]->r++;
        else if(a[u]->v < a[v]->v)
            a[v]->r++;
        else (a[i]->t->r)++;
    }

    for(int i=0;i<3;i++)
    {
        a[i]->v = max(0ll,a[i]->v - a[i]->r);
        a[i]->r = 0;
    }
}

void work()
{
    sort(a,a+3,cmp);

    //end
    if(a[0]->v == 0)
    {
        puts("Rubble!");return;
    }
    if(a[1]->v == 0)
    {
        printf("%c %lld\n",a[0]->c,a[0]->v);return;
    }

    LL A=a[0]->v,B=a[1]->v,C=a[2]->v;

    if(A>= 2*(B+C))
    {
        printf("%c %lld\n",a[0]->c,a[0]->v-(2*B+2*C-1));return;
    }

    if(A<100)
    {
        A_throw();
        work();
        return;
    }

    if(A-C<=1)
    {
        LL t = (C-3)/3;
        for(int i=0;i<3;i++)
            a[i]->v -= 3*t;
        work();
        return;
    }

    if(B==C)
    {
        if(A-B<10)
        {
            A_throw();
            work();
            return;
        }
        LL t = (A-B-4)/4;
        a[0]->v -= 4*t;
        a[1]->v -= t;
        a[2]->v -= t;
        work();
        return;
    }

    if(A-B >= B-C)
    {
        if(B-C<10)
        {
            A_throw();
            work();
            return;
        }
        a[1]->v -= B-C;
        a[0]->v -= 2*(B-C);
        work();
        return;
    }

    if(A==B)
    {
        if(B-C<10)
        {
            A_throw();
            work();
            return;
        }
        LL t= (B-C-3)/3;
        a[1]->v -= 3*t;
        a[0]->v -= 3*t;
        work();
        return;
    }

    if(A-B < B-C)
    {
        if(A-B<10)
        {
            A_throw();
            work();
            return;
        }
        a[1]->v -= A-B;
        a[0]->v -= 2*(A-B);
        work();
        return;
    }
}


int main()
{
    for(int i=0;i<3;i++)
    {
        cin>>_a[i].v;
        a[i] = &_a[i];
        _a[i].t = &_a[(i+1)%3];
        _a[i].c = 'A'+i;
    }
    work();


    return 0;
}