#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 1e9 + 7;
const int inv2 = (Mod+1) / 2;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 111;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }
inline void chmin(ll &a, ll b){ (b<a) ? (a=b) : 0; }

string s;
ull ban = 0, has = 0;

ull pos[3][8][8];

inline int id(int a, int b){ return a*8 + b; }
bool dfs(int p){
	//if(p <= 2){
	//	cout << "dfs " << p << endl;
	//	rep(x, 8) rep(y, 8){
	//		cout << ((ban >> id(x, y)) & 1) << (y != 7 ? ' ' : '\n');
	//	}
	//}
	if(p >= 12 || __builtin_popcountll(ban) >= 64) return 0;
	rep(i, 8) rep(j, 8){
		if(!((ban >> id(i, j)) & 1)){
			ull cur = 0;
			if(s[p] == 'B' || s[p] == 'Q' || s[p] == 'A' || s[p] == 'M') cur |= pos[0][i][j];
			if(s[p] == 'R' || s[p] == 'Q' || s[p] == 'C' || s[p] == 'M') cur |= pos[1][i][j];
			if(s[p] == 'A' || s[p] == 'C' || s[p] == 'M') cur |= pos[2][i][j];
			if(cur & has) continue;
			//if(p <= 1) cout << i << " " << j << "\n";
			//rep(x, 8) rep(y, 8){
			//	cout << ((cur >> id(x, y)) & 1) << (y != 7 ? ' ' : '\n');
			//}
			cur |= ban, swap(ban, cur), has ^= 1ull << id(i, j);
			bool can = dfs(p+1);
			swap(cur, ban), has ^= 1ull << id(i, j);
			if(!can) return 1;
		}
	}
	return 0;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	rep(i, 8) rep(j, 8){
		ull &cur = pos[0][i][j];
		auto ad = [&](int x, int y){
			if(x >= 0 && x < 8 && y >= 0 && y < 8) cur |= (1ull << id(x, y));
		};
		rep(x, 8){
			ad(i-x, j-x), ad(i-x, j+x), ad(i+x, j-x), ad(i+x, j+x);
		}
		//cout << i << " " << j << ": " << "\n";
		//rep(x, 8) rep(y, 8){
		//	cout << ((cur >> id(x, y)) & 1) << (y != 7 ? ' ' : '\n');
		//}
	}

	rep(i, 8) rep(j, 8){
		ull &cur = pos[1][i][j];
		auto ad = [&](int x, int y){
			if(x >= 0 && x < 8 && y >= 0 && y < 8) cur |= (1ull << id(x, y));
		};
		rep(x, 8){
			ad(i-x, j), ad(i, j-x), ad(i+x, j), ad(i, j+x);
		}
	}

	rep(i, 8) rep(j, 8){
		ull &cur = pos[2][i][j];
		auto ad = [&](int x, int y){
			if(x >= 0 && x < 8 && y >= 0 && y < 8) cur |= (1ull << id(x, y));
		};
		ad(i-2, j-1), ad(i-2, j+1), ad(i+2, j-1), ad(i+2, j+1);
		ad(i-1, j-2), ad(i-1, j+2), ad(i+1, j-2), ad(i+1, j+2);
		ad(i, j);
	}

	cin >> s;
	cout << (dfs(0) ? "Alice" : "Bob") << "\n";

	return 0;
}