#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


using U = unsigned long long;
constexpr int K = 6;
constexpr int N = 8;
constexpr int V = N * N;
int id(int x, int y) {
  return x * N + y;
}
U MOVE[K][V];

int A[2 * K];
bool calc(int i, U put, U cov) {
  if (i == 2 * K) {
    return false;
  } else {
    for (U q = ~cov; q; q &= q - 1) {
      const int u = __builtin_ctzll(q);
      if (!(put & MOVE[A[i]][u])) {
        if (!calc(i + 1, put | 1ULL << u, cov | MOVE[A[i]][u])) {
          return true;
        }
      }
    }
    return false;
  }
}

int main() {
  // bishop
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) for (int xx = 0; xx < N; ++xx) for (int yy = 0; yy < N; ++yy) {
    if (x + y == xx + yy || x - y == xx - yy) MOVE[0][id(x, y)] |= 1ULL << id(xx, yy);
  }
  // rook
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) for (int xx = 0; xx < N; ++xx) for (int yy = 0; yy < N; ++yy) {
    if (x == xx || y == yy) MOVE[1][id(x, y)] |= 1ULL << id(xx, yy);
  }
  // queen
  for (int u = 0; u < V; ++u) {
    MOVE[2][u] = MOVE[0][u] | MOVE[1][u];
  }
  // knight
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) for (int xx = 0; xx < N; ++xx) for (int yy = 0; yy < N; ++yy) {
    if ((xx - x) * (xx - x) + (yy - y) * (yy - y) == 5) MOVE[3][id(x, y)] |= 1ULL << id(xx, yy);
  }
  for (int u = 0; u < V; ++u) {
    MOVE[4][u] = MOVE[3][u];
    MOVE[5][u] = MOVE[3][u];
    MOVE[3][u] |= MOVE[0][u];
    MOVE[4][u] |= MOVE[1][u];
    MOVE[5][u] |= MOVE[2][u];
  }
  
  char S[110];
  for (; ~scanf("%s", S); ) {
    for (int i = 0; i < 2 * K; ++i) {
      A[i] = string("BRQACM").find(S[i]);
    }
    const bool ans = calc(0, 0, 0);
    puts(ans ? "Alice" : "Bob");
  }
  return 0;
}