#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;
#define SZ(v) (ll)((v).size())
#define pb emplace_back
#define AI(i) begin(i), end(i)
#define X first
#define Y second
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

using u64 = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  string s;
  cin >> s;

  vector maskBishop(8, vector<u64>(8));
  vector maskRook(8, vector<u64>(8));
  vector maskKnight(8, vector<u64>(8));

  auto in = [&](int x, int y) {
	  return 0 <= x && x < 8 && 0 <= y && y < 8;
  };

  for (int i = 0; i < 8; i++) {
	  for (int j = 0; j < 8; j++) {
		  int x = i, y = j;
		  for (auto [dx, dy] : {pair(1, 1), {1, -1}, {-1, -1}, {-1, 1}}) {
			  int nx = x + dx, ny = y + dy;
			  while (in(nx, ny)) {
				  maskBishop[i][j] |= 1ull << nx * 8 + ny;
				  nx += dx, ny += dy;
			  }
		  }
	  }
  }

  for (int i = 0; i < 8; i++) {
	  for (int j = 0; j < 8; j++) {
		  int x = i, y = j;
		  for (auto [dx, dy] : {pair(1, 0), {0, 1}, {-1, 0}, {0, -1}}) {
			  int nx = x + dx, ny = y + dy;
			  while (in(nx, ny)) {
				  maskRook[i][j] |= 1ull << nx * 8 + ny;
				  nx += dx, ny += dy;
			  }
		  }
	  }
  }

  for (int i = 0; i < 8; i++) {
	  for (int j = 0; j < 8; j++) {
		  int x = i, y = j;
		  for (auto [dx, dy] : {pair(2, 1), {1, 2}, {-1, 2}, {-2, 1}, {-2, -1}, {-1, -2}, {1, -2}, {2, -1}}) {
			  int nx = x + dx, ny = y + dy;
			  if (in(nx, ny)) {
				  maskKnight[i][j] |= 1ull << nx * 8 + ny;
			  }
		  }
	  }
  }

  vector mp(12, map<pair<u64, u64>, bool>());

  vector<vector<int>> cands(2);
  for (int i = 0; i < 4; i++) {
	  for (int j = 0; j <= i; j++) {
		  cands[0].emplace_back(8 * i + j);
	  }
  }
  cands[1].resize(64);
  iota(cands[1].begin(), cands[1].end(), 0);

  auto dfs = [&](auto dfs, int t, u64 atk, u64 occ) -> bool {
	  if (t == 12) {
		  return false;
	  }
	  if (mp[t].count({atk, occ})) {
		  return mp[t][{atk, occ}];
	  }
	  for (auto id : cands[t != 0]) {
		  int i = id / 8, j = id % 8;
		  if (atk >> id & 1 | occ >> id & 1) {
			  continue;
		  }
		  u64 natk = 0;
		  if (s[t] == 'B') {
			  natk |= maskBishop[i][j];
		  } else if (s[t] == 'R') {
			  natk |= maskRook[i][j];
		  } else if (s[t] == 'Q') {
			  natk |= maskBishop[i][j] | maskRook[i][j];
		  } else if (s[t] == 'A') {
			  natk |= maskBishop[i][j] | maskKnight[i][j];
		  } else if (s[t] == 'C') {
			  natk |= maskRook[i][j] | maskKnight[i][j];
		  } else if (s[t] == 'M') {
			  natk |= maskBishop[i][j] | maskRook[i][j] | maskKnight[i][j];
		  }
		  if (natk & occ) {
			  continue;
		  }
		  if (!dfs(dfs, t + 1, atk | natk, occ | 1ull << id)) {
			  return mp[t][{atk, occ}] = true;
		  }

	  }
	  return mp[t][{atk, occ}] = false;
  };

  cout << (dfs(dfs, 0, 0ull, 0ull) ? "Alice" : "Bob") << '\n';

  return 0;
}