#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int N = 15;
const ull M = ULLONG_MAX;
char s[N];
void print(ull x) {
  
  for(int i = 0; i < 8; i++, puts("")) {
    for(int j = 0; j < 8; j++) printf("%d ", x >> (8 * i | j) & 1);
  }
  puts("=====");
}
ull Diag(int i, int j, ull B) {
  int x = i, y = j;
  ull res = 1ull << (x * 8 | y);
  while(x > 0 && y > 0) {
    x--; y--;
    res |= 1ull << (x * 8 | y);
  }
  x = i; y = j;
  while(x < 7 && y < 7) {
    x++; y++;
    res |= 1ull << (x * 8 | y);
  }
  x = i; y = j;
  while(x < 7 && y > 0) {
    x++; y--;
    res |= 1ull << (x * 8 | y);
  }
  x = i; y = j;
  while(x > 0 && y < 7) {
    x--; y++;
    res |= 1ull << (x * 8 | y);
  }
  if(B & res) return M;
  return res;
}
ull Line(int i, int j, ull B) {
  ull res = 0;
  for(int x = 0; x < 8; x++) {
    res |= 1ull << (x * 8 | j);
  }
  for(int y = 0; y < 8; y++) {
    res |= 1ull << (i * 8 | y);
  }
  if(B & res) return M;
  return res;
}
ull Ri(int i, int j, ull B) {
  static int dx[8] = {1, 1, -1, -1, 2, 2, -2, -2};
  static int dy[8] = {2, -2, 2, -2, 1, -1, 1, -1};
  ull res = 0;
  for(int d = 0; d < 8; d++) {
    int x = i + dx[d], y = j + dy[d];
    if(x < 0 || x > 7 || y < 0 || y > 7) continue;
    res |= 1ull << (x * 8 | y);
  }
  if(B & res) return M;
  return res;
}
bool dfs(int k, ull A, ull B) {
  // printf("(%llu %llu) %d\n", A, B, k);
  // system("pause");
  char cur = s[k];
  for(int i = 0; i < 8; i++) {
    for(int j = 0; j < 8; j++) {
      if(A >> (i * 8 | j) & 1) continue;
      // bool pr = false;
      // if(s[k] == 'R' && i == 6 && j == 0) pr = true;
      ull s1 = 0, s2 = 0, s3 = 0;
      // if(k == 2) printf("(%d %d)\n", i, j);
      if(cur == 'B' || cur == 'Q' || cur == 'A' || cur == 'M') {
        s1 = Diag(i, j, B);
      }
      if(cur == 'R' || cur == 'Q' || cur == 'C' || cur == 'M') {
        s2 = Line(i, j, B);
      }
      if(cur == 'A' || cur == 'C' || cur == 'M') {
        s3 = Ri(i, j, B);
      }
      // if(pr) printf("%llu %llu %llu\n", s1, s2, s3);
      if(s1 < M && s2 < M && s3 < M) {
        if(!dfs(k + 1, A | s1 | s2 | s3, (1ull << (i * 8 | j)) | B)) {
          return true;
        }
      }
    }
  }
  // if(s[k] == 'R') {
  //   printf("%c\n", s[k]);
  //   for(int i = 0; i < 8; i++, puts("")) {
  //     for(int j = 0; j < 8; j++) printf("%d ", A >> (8 * i | j) & 1);
  //   }
  //   puts("");
  //   for(int i = 0; i < 8; i++, puts("")) {
  //     for(int j = 0; j < 8; j++) printf("%d ", B >> (8 * i | j) & 1);
  //   }
  //   system("pause");
  // }
  return false;
}
int main() {
  cin >> s;

  if(dfs(0, 0ull, 0ull)) {
    puts("Alice");
  } else {
    puts("Bob");
  }
  // print(Diag(0, 0, 0));
  return 0;
}