#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define V vector
#define pb push_back

void apply_sig(ULL &bit, int x, int y) {
    if(x >= 0 && y >= 0 && x <= 7 && y <= 7) bit |= 1ULL << (x + y * 8);
}

void show(ULL x) {
    for(int i = 0; i < 8; i++) {
        for(int j = 0; j < 8; j++) {
            cout << (x >> (j * 8 + i) & 1);
        }
        cout << endl;
    }
}

ULL apply(ULL bit, int id, char c) {
    int x = id % 8, y = id / 8;
    // cout << "apply : " << c << " on : " << x << " " << y << endl;
    // show(bit);
    if(c == 'R' || c == 'Q' || c == 'M' || c == 'C') {//ju
        for(int i = 0; i < 8; i++) {
            apply_sig(bit, x, i);
            apply_sig(bit, i, y);
        }
    }
    if(c == 'Q' || c == 'M' || c == 'B' || c == 'A') {//xiang
        int n_x = x, n_y = y;
        while(n_x && n_y) n_x--, n_y--;
        while(n_x < 8 && n_y < 8) apply_sig(bit, n_x, n_y), n_x++, n_y++;

        n_x = x, n_y = y;
        while(n_x != 0 && n_y != 7) n_x--, n_y++;
        while(n_x < 8 && n_y >= 0) {
            apply_sig(bit, n_x, n_y), n_x++, n_y--;
        }
    }
    if(c == 'A' || c == 'C' || c == 'M') {
        apply_sig(bit, x - 2, y - 1);
        apply_sig(bit, x - 1, y - 2);
        apply_sig(bit, x - 2, y + 1);
        apply_sig(bit, x - 1, y + 2);
        apply_sig(bit, x + 2, y - 1);
        apply_sig(bit, x + 1, y - 2);
        apply_sig(bit, x + 2, y + 1);
        apply_sig(bit, x + 1, y + 2);
    }
    // cout << "output : " << bit << endl;
    // show(bit);
    // system("pause");
    return bit;
}

int main() {
    string s; cin >> s;
    map<pair<int, ULL>, bool> mp;

    V<V<ULL>> store(64, V<ULL>(26));
    for(int i = 0; i < 64; i++) {
        store[i]['A' - 'A'] = apply(0, i, 'A');
        store[i]['C' - 'A'] = apply(0, i, 'C');
        store[i]['M' - 'A'] = apply(0, i, 'M');
        store[i]['B' - 'A'] = apply(0, i, 'B');
        store[i]['R' - 'A'] = apply(0, i, 'R');
        store[i]['Q' - 'A'] = apply(0, i, 'Q');
        // if(i == 12) {
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'A' << endl;
        //     show(store[i]['A' - 'A']);
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'C' << endl;
        //     show(store[i]['C' - 'A']);
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'M' << endl;
        //     show(store[i]['M' - 'A']);
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'R' << endl;
        //     show(store[i]['R' - 'A']);
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'Q' << endl;
        //     show(store[i]['Q' - 'A']);
        //     cout << " i : " << i << endl;
        //     cout << " c : " << 'B' << endl;
        //     show(store[i]['B' - 'A']);
        // }

    }

    auto better_apply = [&](ULL board, int pos, char c) {
        ULL ans = board | store[pos][c - 'A'];
        // assert(ans == apply(board, pos, c));
        return ans;
    };

    auto id = [&](int x, int y) -> int {
        return y * 8 + x;
    };
    // int time = 0;
    auto dfs = [&](int pos, ULL board, ULL chess, auto dfs) -> bool {
        // time++;
        // if(time % 10000000 == 0) cout << time << endl;
        if(board == ~0ULL) return 0;
        assert(pos < 12);
        bool ok = 0;
        ULL find_board = ~board;
        while(find_board) {
            int i = __lg(find_board);
            find_board ^= 1ULL << i;
            assert(!(board >> i & 1));

            ULL n_board = better_apply(board, i, s[pos]);
            if(better_apply(0, i, s[pos]) & chess) continue;
            ULL n_chess = chess | (1ULL << i);

            if(!dfs(pos + 1, n_board, n_chess, dfs)) {
                ok = 1;
                break;
            }
            
        }
        // return mp[{pos, board}] = ok;
        return ok;
    };
    auto alice = dfs(0, 0, 0, dfs);
    cout << (alice ? "Alice" : "Bob") << endl;
}