#include<bits/stdc++.h>
using std::cin, std::cout;
int n, m;
using u64 = unsigned long long;
std::unordered_map<u64, int> map[15];
u64 atk[256][64];
int id(int x, int y) { return x * 8 + y; }
char c[100];
u64 sid(int x, int y) {
	if(x < 0 || x >= 8) return 0;
	if(y < 0 || y >= 8) return 0;
	return 1ull << id(x, y);
}
bool dfs(u64 s, int id) {
	if(s == 0 || id == 12) {
		return 0;
	}
	auto iter = map[id].find(s);
	if(iter != map[id].end()) return iter -> second;
	int & ans = map[id][s];
	for(u64 x = s;x;x &= x - 1) {
		int p = __builtin_ctzll(x);
		if(~s & atk[c[id]][p]) {
			continue;
		}
		ans = ans || !dfs(s & ~atk[c[id]][p], id + 1);
	}
	return ans;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	for(int i = 0;i < 8;++i) {
		for(int j = 0;j < 8;++j) {
			for(int k = 0;k < 8;++k) {
				atk['R'][id(i, j)] |= 1ull << id(i, k);
				atk['R'][id(i, j)] |= 1ull << id(k, j);
				atk['B'][id(i, j)] |= sid(i + k, j + k);
				atk['B'][id(i, j)] |= sid(i + k, j - k);
				atk['B'][id(i, j)] |= sid(i - k, j + k);
				atk['B'][id(i, j)] |= sid(i - k, j - k);
			}
			atk['K'][id(i, j)] |= sid(i, j);
			for(int u : {2, -2})
				for(int v : {1, -1}) {
					atk['K'][id(i, j)] |= sid(i + u, j + v);
					atk['K'][id(i, j)] |= sid(i + v, j + u);
				}
			atk['Q'][id(i, j)] = atk['R'][id(i, j)] | atk['B'][id(i, j)];
			atk['A'][id(i, j)] = atk['B'][id(i, j)] | atk['K'][id(i, j)];
			atk['C'][id(i, j)] = atk['R'][id(i, j)] | atk['K'][id(i, j)];
			atk['M'][id(i, j)] = atk['Q'][id(i, j)] | atk['K'][id(i, j)];
		}
	}
	cin >> c;
	cout << (dfs(-1ull, 0) ? "Alice" : "Bob") << '\n';
}