#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
const int N = 10;

char s[100];
int vis[N][N];
int cnt[4][N*2], stone[N][N];

int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2};
int dy[] = {1, 2, 2, 1, -1, -2, -2, -1};

bool check(int x, int y, char c) {
    if (c == 'B' || c == 'A') {
        if (cnt[2][x-y+8] || cnt[3][x+y]) return true;
    }
    if (c == 'R' || c == 'C') {
        if (cnt[0][x] || cnt[1][y]) return  true;
    }
    if (c == 'Q' || c == 'M') {
        if (cnt[2][x-y+8] || cnt[3][x+y] || cnt[0][x] || cnt[1][y]) return true;
    }
    if (c == 'A' || c == 'C' || c == 'M') {
        rep (k, 0, 7) {
            int tx = x + dx[k], ty = y + dy[k];
            if (tx >= 1 && tx <= 8 && ty >= 1 && ty <= 8) {
                if (stone[tx][ty]) return true;
            }
        }
    }
    return false;
}

void place(int x, int y, int k, char c) {
    // vis[x][y] += k;
    cnt[0][x] += k;
    cnt[1][y] += k;
    cnt[2][x-y+8] += k;
    cnt[3][x+y] += k;
    stone[x][y]+=k;
    if (c == 'B' || c == 'A') {
        rep (i, -8, 8) {
            int tx = x+i, ty = y+i;
            if (tx>=1&&tx<=8&&ty>=1&&ty<=8) vis[tx][ty]+=k;
            tx = x+i, ty = y-i;
            if (tx>=1&&tx<=8&&ty>=1&&ty<=8) vis[tx][ty]+=k;
        }
    }
    if (c == 'R' || c == 'C') {
        rep (i, 1, 8) vis[x][i] += k, vis[i][y] += k;
    }
    if (c == 'Q' || c == 'M') {
        rep (i, 1, 8) {
            vis[x][i] += k, vis[i][y] += k;
        }
        rep (i, -8, 8) {
            int tx = x+i, ty = y+i;
            if (tx>=1&&tx<=8&&ty>=1&&ty<=8) vis[tx][ty]+=k;
            tx = x+i, ty = y-i;
            if (tx>=1&&tx<=8&&ty>=1&&ty<=8) vis[tx][ty]+=k;
        }
    }
    if (c == 'A' || c == 'C' || c == 'M') {
        rep (k, 0, 7) {
            int tx = x + dx[k], ty = y + dy[k];
            if (tx >= 1 && tx <= 8 && ty >= 1 && ty <= 8) {
                vis[tx][ty] += k;
            }
        }
    }
}

bool dfs(int c) {
    // cout <<c;
    if (c == 13) return false;
    int xx = 8;
    if (c == 1) xx = 4;
    rep (i, 1, xx) {
        rep (j, 1, xx) {
            if (!vis[i][j]) {
                if (!check(i, j, s[c])) {
                    place(i, j, 1, s[c]);
                    int flag = dfs(c+1);
                    place(i, j, -1, s[c]);
                    if (flag == 0) return true;
                }
            }
        }
    }
    return false;
}

int main() {
    scanf("%s", s+1);
    if (dfs(1)) puts("Alice");
    else puts("Bob");
    return 0;
}