#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

map<pair<ull,ull>,bool> MA[15];

string S;

vector<int> dh={1,2,2,1,-1,-2,-2,-1},dw={2,1,-1,-2,-2,-1,1,2};

bool solve(int u,ull ng,ull put){
    if(u==12) return false;
    if(MA[u].count(mp(ng,put))) return MA[u][mp(ng,put)];
    
    vector<int> type(3);
    if(S[u]!='R'&&S[u]!='C') type[0]=1;
    if(S[u]!='B'&&S[u]!='A') type[1]=1;
    if(S[u]=='A'||S[u]=='C'||S[u]=='M') type[2]=1;
    
    for(int a=0;a<8;a++){
        for(int b=0;b<8;b++){
            if((ng&(1uLL<<(a*8+b)))>0) continue;
            
            bool ok=true;
            
            ull nng=ng,nput=put;
            
            if(type[0]){
                for(int i=0;i<8;i++){
                    int j=a+b-i;
                    if(0<=j&&j<8){
                        if((put&(1uLL<<(i*8+j)))>0) ok=false;
                        nng|=(1uLL<<(i*8+j));
                    }
                }
                if(!ok) continue;
                
                for(int i=0;i<8;i++){
                    int j=i-(a-b);
                    if(0<=j&&j<8){
                        if((put&(1uLL<<(i*8+j)))>0) ok=false;
                        nng|=(1uLL<<(i*8+j));
                    }
                }
                if(!ok) continue;
            }
            
            if(type[1]){
                for(int i=0;i<8;i++){
                    int j=b;
                    if((put&(1uLL<<(i*8+j)))>0) ok=false;
                    nng|=(1uLL<<(i*8+j));
                }
                if(!ok) continue;
                
                for(int j=0;j<8;j++){
                    int i=a;
                    if((put&(1uLL<<(i*8+j)))>0) ok=false;
                    nng|=(1uLL<<(i*8+j));
                }
                if(!ok) continue;
            }
            
            if(type[2]){
                for(int k=0;k<8;k++){
                    int i=a+dh[k],j=b+dw[k];
                    if(0<=i&&i<8&&0<=j&&j<8){
                        if((put&(1uLL<<(i*8+j)))>0) ok=false;
                        nng|=(1uLL<<(i*8+j));
                    }
                }
                if(!ok) continue;
            }
            
            nput|=(1uLL<<(a*8+b));
            
            if(!solve(u+1,nng,nput)) return MA[u][mp(ng,put)]=true;
        }
    }
    
    return MA[u][mp(ng,put)]=false;
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>S;
    if(solve(0,0,0)) cout<<"Alice\n";
    else cout<<"Bob\n";
}