#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long 
const int X[8]={1,1,2,2,-1,-1,-2,-2};
const int Y[8]={2,-2,1,-1,2,-2,1,-1};
int mp[100];
ull f[6][64];
char s[100];
int a[100];
const int in[]={0,1,2,3,9,10,11,18,19,27};
ull mi(int x)
{
    return 1ULL<<x;
}
int dfs(int x,ull y,ull z)
{
    if (x==12)
        return 0;
    if (__builtin_popcountll(y)==64)
        return x&1;
    if (x&1)
    {   
        for (int i=0;i<64;++i)
            if (((y>>i)&1)==0&&((z&f[a[x]][i])==0))
                if (dfs(x+1,y|f[a[x]][i],z|mi(i))==0)
                    return 0;
        return 1;
    }
    else
    {
        if (x!=0)
        {
            for (int i=0;i<64;++i)
                 if (((y>>i)&1)==0&&((z&f[a[x]][i])==0))
                    if (dfs(x+1,y|f[a[x]][i],z|mi(i))==1)
                        return 1;
        }
        else
        {
            for (int i:in)
                 if (((y>>i)&1)==0&&((z&f[a[x]][i])==0))
                    if (dfs(x+1,y|f[a[x]][i],z|mi(i))==1)
                        return 1;
        }
        return 0;
    }
}
int main()
{
    mp['B']=0;
    mp['R']=1;
    mp['Q']=2;
    mp['A']=3;
    mp['C']=4;
    mp['M']=5;
    for (int i=0;i<8;++i)
        for (int j=0;j<8;++j)
        {
            int p=i*8+j;
            for (int x=0;x<8;++x)
                for (int y=0;y<8;++y)
                {
                    int q=x*8+y;
                    if (x==i||y==j)
                        f[1][p]|=mi(q);
                    if (abs(x-i)==abs(y-j))
                        f[0][p]|=mi(q);
                }
            f[2][p]=f[0][p]|f[1][p];
            ull tmp=0;
            for (int k=0;k<8;++k)
            {
                int _x=i+X[k];
                int _y=j+Y[k];
                if (_x>=0&&_x<8&&_y>=0&&_y<8)
                    tmp|=mi(_x*8+_y);
            }
            for (int k=0;k<3;++k)
                f[k+3][p]=f[k][p]|tmp;
        }
    scanf("%s",s);
    for (int i=0;i<12;++i)
        a[i]=mp[s[i]];
    if (dfs(0,0,0))
        cout<<"Alice";
    else
        cout<<"Bob";
    return 0;
}