#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

const int N=8;
int cnt[N][N];
int on[N][N];
bool inside(int x,int y){return x>=0&&x<N&&y>=0&&y<N;};
vector<pair<int,int>> bd={{1,1},{1,-1},{-1,1},{-1,-1}};
pair<int,int> ad(pair<int,int> a,pair<int,int> b){
	return {a.f+b.f,a.s+b.s};
}
vector<pair<int,int>> rdir={{1,0},{0,1},{-1,0},{0,-1}};
vector<pair<int,int>> kd={{-1,2},{-1,-2},{1,2},{1,-2},{2,-1},{2,1},{-2,-1},{-2,1}};
vector<pair<int,int>> sl[N][N][256];
void mark1(int x,int y,int z,char c){
	vector<vector<bool>> moze(N,vector<bool>(N));
	if(c=='B'||c=='A'||c=='Q'||c=='M')
		for(auto p:bd){
			pair<int,int> st={x,y};
			while(1){
				moze[st.f][st.s]=1;
				st=ad(st,p);
				if(!inside(st.f,st.s))break;
			}
		}
	
	if(c=='R'||c=='C'||c=='Q'||c=='M')
		for(auto p:rdir){
			pair<int,int> st={x,y};
			while(1){
				moze[st.f][st.s]=1;
				st=ad(st,p);
				if(!inside(st.f,st.s))break;
			}
		}

	if(c=='A'||c=='C'||c=='M')
		for(auto p:kd){
			pair<int,int> st={x,y};
			st=ad(st,p);
			if(inside(st.f,st.s)){
				moze[st.f][st.s]=1;
			}
		}
	for(int i=0;i<N;i++)for(int j=0;j<N;j++)if(moze[i][j]){
		sl[x][y][c].pb({i,j});
	}
}
bool mark(int x,int y,int z,int c){
	if(z==1)
	for(auto p:sl[x][y][c]){
		if(on[p.f][p.s])return 0;
	}
	for(auto p:sl[x][y][c]){
		cnt[p.f][p.s]+=z;
	}
	on[x][y]+=z;
	return 1;
}
string ord;
bool minmax(int k){
	if(k==12)return 0;
	if(k%2==0){ //first player wants 1
		int ib=N,jb=N;
		if(k==0)ib=N/2,jb=N/2;
		for(int i=0;i<ib;i++)for(int j=0;j<jb;j++)if(!cnt[i][j]){
			if(!mark(i,j,1,ord[k]))continue;
			bool r=minmax(k+1);
			mark(i,j,-1,ord[k]);
			if(r){return 1;}
		}
		return 0;
	}
	else{
		for(int i=0;i<N;i++)for(int j=0;j<N;j++)if(!cnt[i][j]){
			if(!mark(i,j,1,ord[k]))continue;
			bool r=minmax(k+1);
			mark(i,j,-1,ord[k]);
			if(!r){return 0;}
		}
		return 1;
	}
}
int main()
{
	rd(ord);
	vector<bool> done(256);
	for(int k=0;k<sz(ord);k++){
		if(done[ord[k]])continue;
		done[ord[k]]=1;
		for(int i=0;i<N;i++)for(int j=0;j<N;j++){
			mark1(i,j,1,ord[k]);
		}
	}
	bool r=minmax(0);
	if(r){
		printf("Alice\n");
	}
	else{
		printf("Bob\n");
	}
	return 0;
}