// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
using ull = unsigned long long;
std::string s;
struct hsh
{
    std::size_t operator()(const std::pair<ull, ull> &x) const { return x.second; }
};
std::unordered_map<std::pair<ull, ull>, bool, hsh> map;
ull B[64], R[64], K[64], Q[64], A[64], C[64], M[64];
int id(int x, int y) { return x << 3 | y; }
ull g(int pos, char type)
{
    switch (type)
    {
    case 'B':
        return B[pos];
    case 'R':
        return R[pos];
    case 'Q':
        return Q[pos];
    case 'A':
        return A[pos];
    case 'C':
        return C[pos];
    case 'M':
        return M[pos];
    default:
        return K[pos];
    }
}
bool dfs(ull x, ull y, int z)
{
    static int cnt;
    ++cnt;
    if (map.count({x, y}))
        return map[{x, y}];
    bool &res = map[{x, y}];
    for (int i = 0; i != 64; ++i)
        if (~x >> i & 1 && !(y & g(i, s[z]))){
        	res |= !dfs(x | g(i, s[z]), y | 1llu << i, z + 1);
        	if(res==1) return res;
		}
            
    return res;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    for (int i = 0; i != 8; ++i)
        for (int j = 0; j != 8; ++j)
        {
            for (int k = -8; k != 8; ++k)
            {
                if (i + k >= 0 && j + k >= 0 && i + k < 8 && j + k < 8)
                    B[id(i, j)] |= 1llu << id(i + k, j + k);
                if (i + k >= 0 && j - k >= 0 && i + k < 8 && j - k < 8)
                    B[id(i, j)] |= 1llu << id(i + k, j - k);
            }
            for (int k = -8; k != 8; ++k)
            {
                if (i + k >= 0 && j >= 0 && i + k < 8 && j < 8)
                    R[id(i, j)] |= 1llu << id(i + k, j);
                if (i >= 0 && j + k >= 0 && i < 8 && j + k < 8)
                    R[id(i, j)] |= 1llu << id(i, j + k);
            }
            for (int iv = -2; iv <= 2; ++iv)
                for (int jv = -2; jv <= 2; ++jv)
                    if (std::abs(iv) + std::abs(jv) == 3 && i + iv >= 0 && j + jv >= 0 && i + iv < 8 && j + jv < 8)
                        K[id(i, j)] |= 1llu << id(i + iv, j + jv);
            K[id(i, j)] |= 1llu << id(i, j);
            Q[id(i, j)] = B[id(i, j)] | R[id(i, j)];
            A[id(i, j)] = B[id(i, j)] | K[id(i, j)];
            C[id(i, j)] = R[id(i, j)] | K[id(i, j)];
            M[id(i, j)] = Q[id(i, j)] | K[id(i, j)];
        }
    std::cin >> s;
    std::cout << (dfs(0, 0, 0) ? "Alice" : "Bob") << std::endl;
    return 0;
}