#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

bool OUT(int x, int y) { return !(0 <= x and x < 8 and 0 <= y and y < 8); }

vector<pii> attackSet(int msk, int x, int y) {
    vector<pii> res;
    if (msk & 1) {
        for(int i = 1; i < 8; i++) for(int r1 : {-1, 1}) for(int r2 : {-1, 1})
            if (!OUT(x + r1 * i, y + r2 * i))
                res.emplace_back(x + r1 * i, y + r2 * i);
    }
    if (msk & 2) {
        for(int i = -7; i < 8; i++) {
            if (i != 0 and !OUT(x + i, y))
                res.emplace_back(x + i, y);
            if (i != 0 and !OUT(x, y + i))
                res.emplace_back(x, y + i);
        }
    }
    if (msk & 4) {
        for(int i : {-2, -1, 1, 2})
            for(int j : {-2, -1, 1, 2})
                if (abs(i) != abs(j) and !OUT(x + i, y + j))
                    res.emplace_back(x + i, y + j);
    }
    return res;
}

using board = array<array<bool, 8>, 8>;

vector<pii> pre[8][8][8];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    for(int i = 1; i < 8; i++)
        for(int j = 0; j < 8; j++)
            for(int k = 0; k < 8; k++)
                pre[i][j][k] = attackSet(i, j, k);

    string s; cin >> s;
    array<int, 12> id;
    for(int i = 0; i < 12; i++) {
        char c = s[i];
        if (c == 'B') id[i] = 1;
        if (c == 'R') id[i] = 2;
        if (c == 'Q') id[i] = 3;
        if (c == 'A') id[i] = 5;
        if (c == 'C') id[i] = 6;
        if (c == 'M') id[i] = 7;
    }

    auto dfs = [&](int cnt, board pos, board attacked, auto self) -> bool {
        if (cnt == 12) return false;
        for(int i = 0; i < 8; i++) for(int j = 0; j < 8; j++) if (!attacked[i][j] and !pos[i][j]) {
            bool valid = true;
            for(auto [x, y] : pre[id[cnt]][i][j])
                valid = valid and !pos[x][y];
            if (valid) {
                auto tmp = attacked;
                pos[i][j] = true;
                for(auto [x, y] : pre[id[cnt]][i][j])
                    tmp[x][y] = true;
                if (!self(cnt + 1, pos, tmp, self)) return true;
                pos[i][j] = false;
            }
        }

        return false;
    };

    board init = {};
    cout << (dfs(0, init, init, dfs) ? "Alice\n" : "Bob\n");
}