#include <bits/stdc++.h>
using namespace std;

bool valid(int x, int y) {
	return (x >= 0 && y >= 0 && x < 8 && y < 8);
}

bitset<64> fill(bitset<64> bs, char c, int st) {
	int x = st/8, y = st%8;
	bs[st] = 1;
	// up down
	if (c == 'R' || c == 'Q' || c == 'C' || c == 'M') {
		for (int i = 0; i < 8; i++) {
			if (valid(x-i, y)) {int g = (x-i)*8 + y; bs[g] = 1;}
			if (valid(x+i, y)) {int g = (x+i)*8 + y; bs[g] = 1;}
			if (valid(x, y-1)) {int g = x*8 + (y-i); bs[g] = 1;}
			if (valid(x, y+1)) {int g = x*8 + (y+i); bs[g] = 1;}
		}
	}

	// diagonal
	if (c == 'B' || c == 'Q' || c == 'A' || c == 'M') {
		for (int i = 0; i < 8; i++) {
			if (valid(x-i, y-i)) {int g = (x-i)*8 + (y-i); bs[g] = 1;}
			if (valid(x+i, y-i)) {int g = (x+i)*8 + (y-i); bs[g] = 1;}
			if (valid(x-i, y+i)) {int g = (x-i)*8 + (y+i); bs[g] = 1;}
			if (valid(x+i, y+i)) {int g = (x+i)*8 + (y+i); bs[g] = 1;}
		}
	}

	// knight
	if (c == 'A' || c == 'C' || c == 'M') {
		if (valid(x-1, y-2)) {int g = (x-1)*8 + (y-2); bs[g] = 1;}
		if (valid(x+1, y-2)) {int g = (x+1)*8 + (y-2); bs[g] = 1;}
		if (valid(x-1, y+2)) {int g = (x-1)*8 + (y+2); bs[g] = 1;}
		if (valid(x+1, y+2)) {int g = (x+1)*8 + (y+2); bs[g] = 1;}
		if (valid(x-2, y-1)) {int g = (x-2)*8 + (y-1); bs[g] = 1;}
		if (valid(x+2, y-1)) {int g = (x+2)*8 + (y-1); bs[g] = 1;}
		if (valid(x-2, y+1)) {int g = (x-2)*8 + (y+1); bs[g] = 1;}
		if (valid(x+2, y+1)) {int g = (x+2)*8 + (y+1); bs[g] = 1;}
	}

	return bs;
}

bool check_attack(bitset<64> ps, char c, int st) {
	int x = st/8, y = st%8;

	// up down
	if (c == 'R' || c == 'Q' || c == 'C' || c == 'M') {
		for (int i = 0; i < 8; i++) {
			if (valid(x-i, y)) {int g = (x-i)*8 + y; if (ps[g] == 1) return 0;}
			if (valid(x+i, y)) {int g = (x+i)*8 + y; if (ps[g] == 1) return 0;}
			if (valid(x, y-1)) {int g = x*8 + (y-i); if (ps[g] == 1) return 0;}
			if (valid(x, y+1)) {int g = x*8 + (y+i); if (ps[g] == 1) return 0;}
		}
	}

	// diagonal
	if (c == 'B' || c == 'Q' || c == 'A' || c == 'M') {
		for (int i = 0; i < 8; i++) {
			if (valid(x-i, y-i)) {int g = (x-i)*8 + (y-i); if (ps[g] == 1) return 0;}
			if (valid(x+i, y-i)) {int g = (x+i)*8 + (y-i); if (ps[g] == 1) return 0;}
			if (valid(x-i, y+i)) {int g = (x-i)*8 + (y+i); if (ps[g] == 1) return 0;}
			if (valid(x+i, y+i)) {int g = (x+i)*8 + (y+i); if (ps[g] == 1) return 0;}
		}
	}

	// knight
	if (c == 'A' || c == 'C' || c == 'M') {
		if (valid(x-1, y-2)) {int g = (x-1)*8 + (y-2); if (ps[g] == 1) return 0;}
		if (valid(x+1, y-2)) {int g = (x+1)*8 + (y-2); if (ps[g] == 1) return 0;}
		if (valid(x-1, y+2)) {int g = (x-1)*8 + (y+2); if (ps[g] == 1) return 0;}
		if (valid(x+1, y+2)) {int g = (x+1)*8 + (y+2); if (ps[g] == 1) return 0;}
		if (valid(x-2, y-1)) {int g = (x-2)*8 + (y-1); if (ps[g] == 1) return 0;}
		if (valid(x+2, y-1)) {int g = (x+2)*8 + (y-1); if (ps[g] == 1) return 0;}
		if (valid(x-2, y+1)) {int g = (x-2)*8 + (y+1); if (ps[g] == 1) return 0;}
		if (valid(x+2, y+1)) {int g = (x+2)*8 + (y+1); if (ps[g] == 1) return 0;}
	}

	return 1;
}

bool go(string &s, int i, bitset<64> bs, bitset<64> ps) {
	if (i == 12) return 0;

	for (int j = 0; j < 64; j++) {
		if (!bs[j] && check_attack(ps, s[i], j)) {
			bitset<64> nx1 = fill(bs, s[i], j);
			bitset<64> nx2 = ps; nx2[j] = 1;
			if (!go(s, i+1, nx1, nx2)) {
				return 1;
			}
		}
	}
	return 0;
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	string s; cin >> s;
	bitset<64> bs;
	if (go(s, 0, bs, bs)) {
		cout << "Alice\n";
	} else {
		cout << "Bob\n";
	}

	return 0;
}