#include <bits/stdc++.h>
#define ull unsigned long long
//#define int long long
using namespace std;

const int maxn = 10;
const int maxt = 6;

ull bit[8][8];
int check(const int x,const int y) { return x>=0 && y>=0 && x<8 && y<8; }
ull bishop(const int x,const int y)
{
	ull ret=bit[x][y];
		for(int i=x-1,j=y-1;i>=0&&j>=0;i--,j--)
			ret|= bit[i][j];
		
		for(int i=x-1,j=y+1;i>=0&&j<8;i--,j++)
			ret|= bit[i][j];
		
		for(int i=x+1,j=y-1;i<8&&j>=0;i++,j--)
			ret|= bit[i][j];
		
		for(int i=x+1,j=y+1;i<8&&j<8;i++,j++)
			ret|= bit[i][j];
		
	return ret;	
}
ull rook(const int x,const int y)
{
	ull ret=bit[x][y];
		for(int i=x,j=y-1;j>=0;j--)
			ret|= bit[i][j];
		
		for(int i=x,j=y+1;j<8;j++)
			ret|= bit[i][j];
		
		for(int j=y,i=x-1;i>=0;i--)
			ret|= bit[i][j];
		
		for(int j=y,i=x+1;i<8;i++)
			ret|=bit[i][j];
		
	return ret;
}
ull queen(const int x,const int y)
{
	ull ret=bit[x][y];
	ret|= bishop(x,y);
	ret|= rook(x,y);
	return ret;
}
int dx[]={-2,-2,-1,-1,+1,+1,+2,+2};
int dy[]={-1,+1,-2,+2,-2,+2,-1,+1};
ull knight(const int x,const int y)
{
	ull ret=bit[x][y];
	for(int dir=0;dir<8;dir++)
	{
		int i=x+dx[dir];
		int j=y+dy[dir];
		if(check(i,j))
			ret|=bit[i][j];
	}
	return ret;
}
ull occupy(const int ty,const int x,const int y)
{
	ull ret= bit[x][y];
	if(ty%3==0) ret|=bishop(x,y);
	if(ty%3==1) ret|=rook(x,y);
	if(ty%3==2) ret|=queen(x,y);
	if(ty>=3) ret|=knight(x,y);
	return ret;
}
ull v[maxt][maxn][maxn];
void pre()
{
	for(int i=0;i<8;i++) for(int j=0;j<8;j++)
		bit[i][j]= (1llu)<<(i*8+j);
	for(int t=0;t<maxt;t++) for(int i=0;i<8;i++) for(int j=0;j<8;j++)
		v[t][i][j]= occupy(t,i,j);
}

int id[1000];
string str;

map< tuple<int,ull,ull>, int >mp;
int solve(const int pos,const ull S,const ull capS)
{
	const auto temp= make_tuple(pos,S,capS);
	if(mp.count(temp)!=0) return mp[temp];
	
	int ty=id[(int)str[pos]];
	int ok=0;
	for(int i=0;i<8 && ok==0;i++) for(int j=0;j<8 && ok==0;j++) if( !(capS>>(i*8+j)&1llu) )
	{
		if( (v[ty][i][j]&S)==0llu )
		{
			if( !solve(pos+1,S|bit[i][j],capS|v[ty][i][j]) )
			{
				ok=1;
				break;
			}
		}
	}
	
	return mp[temp]=ok;
}

signed main()
{
	//freopen("tmp.in","r",stdin);
	ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	id['B']=0, id['R']=1, id['Q']=2;
	id['A']=3, id['C']=4, id['M']=5;
	//0:bishop	1:rook	2:queen
	//0~2,  3~5:knight
	
	pre();
	cin>>str;
	int ok= solve(0,0,0);
	if(ok) cout<<"Alice\n";
	else cout<<"Bob\n";
	
	return 0;	
}