#include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)


void solve(){
    string S;
    cin>>S;
    int N=S.size();
    vector<vector<int>> p(N,vector<int>(3));//(kaku,hisya,keima)
    rep(i,0,N) {
        if (S[i] == 'B') p[i][0] = 1;
        if (S[i] == 'R') p[i][1] = 1;
        if (S[i] == 'Q') p[i][0] = 1, p[i][1] = 1;
        if (S[i] == 'A') p[i][0] = 1, p[i][2] = 1;
        if (S[i] == 'C') p[i][1] = 1, p[i][2] = 1;
        if (S[i] == 'M') p[i][0] = 1, p[i][1] = 1, p[i][2] = 1;
    }
    const int M=8;
    vector<vector<int>> ban(M,vector<int>(M));
    vector<vector<int>> table(M,vector<int>(M));
    vector<int> dx={2,2,1,1,-1,-1,-2,-2};
    vector<int> dy={1,-1,2,-2,2,-2,1,-1};
    auto ins=[&](int a,int b) -> bool {
        return 0<=min(a,b)&&max(a,b)<M;
    };
    ll B=0,T=0;
    auto g=[&](int x,int y,int val) -> bool {
        if(!ins(x,y)) return true;
        ban[x][y]+=val;
        int z=x*M+y;
        B=(B|(1ll<<z));
        if(ban[x][y]==0) B-=(1ll<<z);
        return (0==table[x][y]);
    };
    auto pu=[&](int x,int y,int ind,int val) -> bool {
        bool res=1;
        if(table[x][y]) res=0;
        if(p[ind][0]){
            rep(i,-M,M){
                int s,t;
                s=x+i,t=y+i;
                res&=g(s,t,val);
                s=x+i,t=y-i;
                res&=g(s,t,val);
            }
        }
        if(p[ind][1]){
            rep(i,0,M){
                res&=g(i,y,val);
                res&=g(x,i,val);
            }
        }
        if(p[ind][2]){
            rep(i,0,M){
                int s=x+dx[i];
                int t=y+dy[i];
                res&=g(s,t,val);
            }
        }
        table[x][y]+=val;
        T=(T|(1ll<<(x*M+y)));
        if(table[x][y]==0) T-=(1ll<<(x*M+y));
        return res;
    };
    map<tuple<int,ll,ll>,bool> m;
    auto f=[&](auto self,int ind) -> bool {
        if(ind==N) return false;
        if(m.count({ind,B,T})) return m[{ind,B,T}];
        rep(i,0,8) rep(j,0,8){
            if(ind==0&&max(i,j)>=4) break;
            if(ban[i][j]) continue;
            auto tmp=pu(i,j,ind,1);bool res=1;
            if(tmp){
                res=self(self,ind+1);
            }
            pu(i,j,ind,-1);
            if(!res){
                m[{ind,B,T}]=1;
                return true;
            }
        }
        m[{ind,B,T}]=0;
        return false;
    };
    auto ans=f(f,0);
    cout<<(ans?"Alice\n":"Bob\n");
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

// BBAARRCCQQMM