#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using ull = unsigned long long;
const int MAX = 8, PIECE = 6;

int f(int x, int y) { return x * MAX + y; }

int ctoi(char c) {
    if (c == 'B') return 0;
    if (c == 'R') return 1;
    if (c == 'Q') return 2;
    if (c == 'A') return 3;
    if (c == 'C') return 4;
    if (c == 'M') return 5;
    assert(false);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector mass(PIECE + 1, vector<ull>(MAX * MAX, 0));
    for (int x = 0; x < MAX; x++) {
        for (int y = 0; y < MAX; y++) {
            for (int nx = 0; nx < MAX; nx++) {
                for (int ny = 0; ny < MAX; ny++) {
                    if (x - y == nx - ny or x + y == nx + ny) mass[0][f(x, y)] |= 1ULL << f(nx, ny);
                    if (x == nx or y == ny) mass[1][f(x, y)] |= 1ULL << f(nx, ny);
                    if (x == nx and y == ny) mass[6][f(x, y)] |= 1ULL << f(nx, ny);
                    if (abs(x - nx) == 2 and abs(y - ny) == 1)
                        mass[6][f(x, y)] |= 1ULL << f(nx, ny);
                    else if (abs(x - nx) == 1 and abs(y - ny) == 2)
                        mass[6][f(x, y)] |= 1ULL << f(nx, ny);
                }
            }
            mass[2][f(x, y)] = mass[0][f(x, y)] | mass[1][f(x, y)];
            mass[3][f(x, y)] = mass[0][f(x, y)] | mass[6][f(x, y)];
            mass[4][f(x, y)] = mass[1][f(x, y)] | mass[6][f(x, y)];
            mass[5][f(x, y)] = mass[2][f(x, y)] | mass[6][f(x, y)];
        }
    }
    string S;
    cin >> S;
    int n = S.size();
    // vector<map<pair<ull, ull>, int>> mp(n + 1);
    auto dfs = [&](auto self, ull cur, ull koma, int d) -> int {
        // if (mp[d].count({cur, koma})) return mp[d][{cur, koma}];
        assert(d < n);
        int c = ctoi(S[d]);
        for (int i = 0; i < MAX * MAX; i++) {
            if (cur >> i & 1) continue;
            if (koma & mass[c][i]) continue;
            // if (self(self, cur | mass[c][i], koma | 1ULL << i, d + 1) == 0) return mp[d][{cur, koma}] = 1;
            if (self(self, cur | mass[c][i], koma | 1ULL << i, d + 1) == 0) return 1;
        }
        // return mp[d][{cur, koma}] = 0;
        return 0;
    };
    int ans = dfs(dfs, 0, 0, 0);
    cout << (ans ? "Alice" : "Bob") << "\n";
    return 0;
}