#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second

using namespace std;

typedef unsigned long long ull;
vector<pair<int, int> > knight = { {-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {1, -2}, {1, 2}, {2, -1}, {2, 1} };

bool ok(int i)
{
    return (i >= 0 && i < 8);
}
bool ok(int i, int j)
{
    return (i >= 0 && i < 8 && j >= 0 && j < 8);
}
int id(int i, int j)
{
    return 8*i+j;
}

ull Move(ull bef, char c, int x, int y)
{
    bef |= ull(1) << id(x, y);
    if (c == 'A' || c == 'C' || c == 'M')
    {
        for (auto [i, j] : knight)
            if (ok(x+i, y+j))
                bef |= ull(1) << id(x+i, y+j);
    }
    if (c == 'B' || c == 'A' || c == 'Q' || c == 'M')
    {
        for (int i=0; i<8; i++)
        {
            if (ok(x+y-i))
                bef |= ull(1) << id(i, x+y-i);
            if (ok(-x+y+i))
                bef |= ull(1) << id(i,-x+y+i);
        }
    }
    if (c == 'R' || c == 'C' || c == 'Q' || c == 'M')
    {
        for (int i=0; i<8; i++)
        {
            bef |= ull(1) << id(i, y);
            bef |= ull(1) << id(x, i);
        }
    }
    return bef;
}
bool CanPlace(ull bef, char c, int x, int y)
{
    if (bef & (ull(1) << id(x, y)))
        return false;
    if (c == 'A' || c == 'C' || c == 'M')
    {
        for (auto [i, j] : knight)
            if (ok(x+i, y+j))
                if (bef & (ull(1) << id(x+i, y+j)))
                    return false;
    }
    if (c == 'B' || c == 'A' || c == 'Q' || c == 'M')
    {
        for (int i=0; i<8; i++)
        {
            if (ok(x+y-i))
                if (bef & (ull(1) << id(i, x+y-i)))
                    return false;
            if (ok(-x+y+i))
                if (bef & (ull(1) << id(i,-x+y+i)))
                    return false;
        }
    }
    if (c == 'R' || c == 'C' || c == 'Q' || c == 'M')
    {
        for (int i=0; i<8; i++)
        {
            if (bef & (ull(1) << id(i, y)))
                return false;
            if (bef & (ull(1) << id(x, i)))
                return false;
        }
    }
    return true;
}

int cnt(ull brd)
{
    return __builtin_popcountll(brd);
}

string s;
map<pair<ull, ull>, bool> mp[20];

void out(ull brd)
{
    for (int x=0; x<8; x++, cout<<endl)
        for (int y=0; y<8; y++)
            cout<<((brd>>id(x, y))&1);
    cout<<endl;
}

bool win(ull brd, ull figs, int i)
{
    if (i == 12)
        return 0;
    if (cnt(brd) == 64)
        return false;
    if (mp[i].count({brd, figs}))
        return mp[i][{brd, figs}];

    vector<pair<ull, ull> > brds;
    for (int x=0; x<8; x++)
        for (int y=0; y<8; y++)
            if (((brd>>id(x, y)) & ull(1)) == 0)
                if (CanPlace(figs, s[i], x, y))
                    brds.pb({Move(brd, s[i], x, y), figs | (ull(1) << id(x, y))});
    sort(brds.begin(), brds.end(), [](pair<ull, ull> x, pair<ull, ull> y){ return cnt(x.fi) > cnt(y.fi); });

    bool ok = false;
    for (auto b : brds)
        if (!win(b.fi, b.se, i+1))
    {
        ok = true;
        break;
    }

//    cout<<ok<<" "<<i<<" "<<s[i]<<"\n";
//    out(brd);

    return mp[i][{brd, figs}] = ok;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

//    freopen("out.txt", "w", stdout);

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