#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int n = 8;

vector<pair<int, int>> get_bishop() {
    vector<pair<int, int>> res;
    for (int i = 1; i <= n - 1; i++) {
        res.emplace_back(i, i);
        res.emplace_back(-i, i);
        res.emplace_back(i, -i);
        res.emplace_back(-i, -i);
    }
    return res;
}

vector<pair<int, int>> get_rook() {
    vector<pair<int, int>> res;
    for (int i = 1; i <= n - 1; i++) {
        res.emplace_back(i, 0);
        res.emplace_back(-i, 0);
        res.emplace_back(0, i);
        res.emplace_back(0, -i);
    }
    return res;
}

vector<pair<int, int>> get_queen() {
    vector<pair<int, int>> res;
    auto rook = get_rook();
    auto bishop = get_bishop();
    for (auto d : rook) {
        res.push_back(d);
    }
    for (auto d : bishop) {
        res.push_back(d);
    }
    return res;
}

vector<pair<int, int>> get_knight() {
    vector<pair<int, int>> res;
    for (int i = -2; i <= 2; i++) {
        for (int j = -2; j <= 2; j++) {
            if (i != 0 && j != 0 && abs(i) != abs(j)) {
                res.emplace_back(i, j);
            }
        }
    }
    return res;
}

vector<pair<int, int>> get_archibishop() {
    vector<pair<int, int>> res;
    auto bishop = get_bishop();
    auto knight = get_knight();
    for (auto d : bishop) {
        res.push_back(d);
    }
    for (auto d : knight) {
        res.push_back(d);
    }
    return res;
}

vector<pair<int, int>> get_chancellor() {
    vector<pair<int, int>> res;
    auto rook = get_rook();
    auto knight = get_knight();
    for (auto d : rook) {
        res.push_back(d);
    }
    for (auto d : knight) {
        res.push_back(d);
    }
    return res;
}

vector<pair<int, int>> get_maharaja() {
    vector<pair<int, int>> res;
    auto queen = get_queen();
    auto knight = get_knight();
    for (auto d : queen) {
        res.push_back(d);
    }
    for (auto d : knight) {
        res.push_back(d);
    }
    return res;
}

vector<pair<int, int>> db = get_bishop();
vector<pair<int, int>> dr = get_rook();
vector<pair<int, int>> dq = get_queen();
vector<pair<int, int>> da = get_archibishop();
vector<pair<int, int>> dc = get_chancellor();
vector<pair<int, int>> dm = get_maharaja();

bool used[n + 2][n + 2];
int cnt[n + 2][n + 2];

bool solve(int idx, const string& s) {
    if (idx == s.size()) {
        return false;
    } else {
        bool ans = false;
        vector<pair<int, int>>* dcur = &db;
        if (s[idx] == 'B') {
            dcur = &db;
        } else if (s[idx] == 'R') {
            dcur = &dr;
        } else if (s[idx] == 'Q') {
            dcur = &dq;
        } else if (s[idx] == 'A') {
            dcur = &da;
        } else if (s[idx] == 'C') {
            dcur = &dc;
        } else if (s[idx] == 'M') {
            dcur = &dm;
        } else {
            assert(false);
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (!used[i][j] && cnt[i][j] == 0) {
                    bool ok = true;
                    for (auto [di, dj] : *dcur) {
                        if (1 <= i + di && i + di <= n && 1 <= j + dj && j + dj <= n) {
                            if (used[i + di][j + dj]) {
                                ok = false;
                            }
                        }
                    }
                    if (ok) {
                        used[i][j] = true;
                        for (auto [di, dj] : *dcur) {
                            if (1 <= i + di && i + di <= n && 1 <= j + dj && j + dj <= n) {
                                cnt[i + di][j + dj]++;
                            }
                        }
                        ans |= !solve(idx + 1, s);
                        used[i][j] = false;
                        for (auto [di, dj] : *dcur) {
                            if (1 <= i + di && i + di <= n && 1 <= j + dj && j + dj <= n) {
                                cnt[i + di][j + dj]--;
                            }
                        }
                        if (ans) {
                            return true;
                        }
                    }
                }
            }
        }
        return ans;
    }
}

void foo() {
    char a[n + 2][n + 2];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            a[i][j] = '.';
        }
    }
    int x = 3, y = 4;
    a[x][y] = '*';
    for (auto [dx, dy] : dm) {
        if (1 <= x + dx && x + dx <= n && 1 <= y + dy && y + dy <= n) {
            a[x + dx][y + dy] = 'x';
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cout << a[i][j];
        }
        cout << "\n";
    }
    exit(0);
}

void stress_time() {
    mt19937 rnd;
    string s = "BBAARRCCQQMM";
    while (true) {
        shuffle(s.begin(), s.end(), rnd);
        cout << s << endl;
        if (solve(0, s)) {
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                assert(used[i][j] == false);
                assert(cnt[i][j] == 0);
            }
        }
    }
    exit(0);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    // foo();
    // stress_time();

    string s;
    cin >> s;
    if (solve(0, s)) {
        cout << "Alice\n";
    } else {
        cout << "Bob\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}