#include <bits/stdc++.h>
using namespace std;
const int N = 1e9, n = 8;
typedef pair<int, int> pr;
string str;
int t[10][10], has[10][10];
// t: 之前能攻击到的
// has: 之前有的
vector<pr> V = {pr(-1, -2), pr(-1, 2), pr(1, 2),  pr(1, -2),
                pr(2, 1),   pr(2, -1), pr(-2, 1), pr(-2, -1)};
bool Put(char ch, int x, int y) {
	int at[10][10];
	memcpy(at, t, sizeof(t));
	if (ch == 'B' || ch == 'A' || ch == 'Q' || ch == 'M') {
		for (int i = -1; i <= 1; i += 2) {
			for (int j = -1; j <= 1; j += 2) {
				int tx = x, ty = y;
				while (tx >= 1 && tx <= n && ty >= 1 && ty <= n) {
					if (has[tx][ty]) return 0;
					at[tx][ty]++;
					tx += i, ty += j;
				}
			}
		}
	}
	if (ch == 'R' || ch == 'C' || ch == 'Q' || ch == 'M') {
		for (int i = -1; i <= 1; i += 2) {
			for (int j = -1; j <= 1; j += 2) {
				int tx = x, ty = y;
				while (tx >= 1 && tx <= n && ty >= 1 && ty <= n) {
					if (has[tx][ty]) return 0;
					at[tx][ty]++;
					tx += (i + j) / 2, ty += (i - j) / 2;
				}
			}
		}
	}
	if (ch == 'A' || ch == 'C' || ch == 'M') {
		for (auto [i, j] : V) {
			int tx = x + i, ty = y + j;
			if (tx >= 1 && tx <= n && ty >= 1 && ty <= n) {
				if (has[tx][ty]) return 0;
				at[tx][ty]++;
			}
		}
	}
	memcpy(t, at, sizeof(t));
	return 1;
}
bool dfs(int x) {
	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			if (t[i][j]) continue;
			int tt[10][10];
			memcpy(tt, t, sizeof(t));
			if (Put(str[x], i, j)) {
				has[i][j] = 1;
				if (!dfs(x + 1)) {
					memcpy(t, tt, sizeof(t));
					has[i][j] = 0;
					return 1;
				}
				has[i][j] = 0;
				memcpy(t, tt, sizeof(t));
			}
		}
	}
	return 0;
}
int main() {
	cin >> str;
	cout << (dfs(0) ? "Alice" : "Bob");
}