#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _48SMghu ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

using ull=unsigned long long;

void slv(){
	int n=8;
	auto ok=[&](int i,int j){
		return min(i,j)>=0 and max(i,j)<n;
	};
	auto id=[&](int i,int j){
		return i*n+j;
	};
	auto piece=[&](char ch){
		int ret=0;
		if(ch=='R'){
			ret=1;
		}else if(ch=='B'){
			ret=2;
		}else if(ch=='Q'){
			ret=3;
		}else if(ch=='A'){
			ret=4;
		}else if(ch=='M'){
			ret=5;
		}else if(ch=='C'){
			ret=6;
		}
		return ret;
	};
	vec(vec(ull)) graf(7,vec(ull)(64));
	// K
	{
		const int di[]={-2,-2,-1,-1,2,2,1,1};
		const int dj[]={1,-1,2,-2,1,-1,2,-2};
		rep(i,n){
			rep(j,n){
				ull msk=0;
				rep(dir,8){
					int ni=i+di[dir],nj=j+dj[dir];
					if(ok(ni,nj)){
						msk|=(1ull<<id(ni,nj));
					}
				}
				msk|=(1ull<<id(i,j));
				graf[0][id(i,j)]=msk;
			}
		}
	}
	// R
	{
		rep(i,n){
			rep(j,n){
				ull msk=0;
				rep(j1,n){
					msk|=(1ull<<id(i,j1));
				}
				rep(i1,n){
					msk|=(1ull<<id(i1,j));	
				}
				graf[1][id(i,j)]=msk;
			}
		}
	}
	// B
	{
		rep(i,n){
			rep(j,n){
				ull msk=0;
				rep(i1,n){
					rep(j1,n){
						if(i1-j1==i-j or i1+j1==i+j){
							msk|=(1ull<<id(i1,j1));
						}
					}
				}
				graf[2][id(i,j)]=msk;
			}
		}
	}
	// Q
	{
		rep(i,n){
			rep(j,n){
				graf[3][id(i,j)]=graf[1][id(i,j)]|graf[2][id(i,j)];
			}
		}
	}
	// A
	{
		rep(i,n){
			rep(j,n){
				graf[4][id(i,j)]=graf[2][id(i,j)]|graf[0][id(i,j)];
			}
		}
	}
	// M
	{
		rep(i,n){
			rep(j,n){
				graf[5][id(i,j)]=graf[0][id(i,j)]|graf[3][id(i,j)];
			}
		}
	}
	// C
	{
		rep(i,n){
			rep(j,n){
				graf[6][id(i,j)]=graf[1][id(i,j)]|graf[0][id(i,j)];
			}
		}
	}
	string s;
	cin>>s;
	// rep(i,n){
	// 	rep(j,n){
	// 		if(graf[2][n+2]>>id(i,j)&1){
	// 			cout<<"1";
	// 		}else{
	// 			cout<<"0";
	// 		}
	// 	}
	// 	print();
	// }
	map<array<ull,3>,int> mp;
	auto rec=[&](auto self,int i,ull placed,ull attacked)->int{
		if(i==sz(s)){
			return 0;
		}
		// if(i<3){
		// 	print("go");
		// }
		// else{
		// 	// print(i,__builtin_popcountll(attacked));
		// 	return 0;
		// }
		if(mp.find({(ull)i,placed,attacked})!=mp.end()){
			return mp[{(ull)i,placed,attacked}];
		}
		int id=piece(s[i]);
		int ret=0;
		rep(v,64){
			if(attacked&(1ull<<v)) continue;
			if(graf[id][v]&placed) continue;
			if(not self(self,i+1,placed|(1ull<<v),attacked|graf[id][v])){
				ret=1;
				break;
			}
		}
		return mp[{(ull)i,placed,attacked}]=ret;
	};
	if(rec(rec,0,0,0)){
		cout<<"Alice\n";
	}else{
		cout<<"Bob\n";
	}
}

signed main(){
_48SMghu;
	slv();
}