use std::collections::*;
use std::io::Write;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        s: bytes,
    }
    let rook = "RQCM";
    let bishop = "BQAM";
    let knight = "ACM";
    let pos = |x: usize, y: usize| x * 8 + y;
    let bit = |bit: usize, x: usize| -> usize { bit >> x & 1 };
    let calc = recurse(|rec, (state, place, k): (usize, usize, usize)| -> bool {
        if state == !0 {
            return false;
        }
        let c = s[k];
        (0..64).any(|i| {
            if state >> i & 1 == 1 {
                return false;
            }
            let x = i / 8;
            let y = i % 8;
            let mut state = state;
            if rook.bytes().any(|s| s == c) {
                for j in 0..8 {
                    if bit(place, pos(x, j)) == 1 || bit(place, pos(j, y)) == 1 {
                        return false;
                    }
                    state |= 1 << pos(x, j);
                    state |= 1 << pos(j, y);
                }
            }
            if bishop.bytes().any(|s| s == c) {
                for &(dx, dy) in [(1, 1), (1, !0), (!0, 1), (!0, !0)].iter() {
                    for j in 0..8 {
                        let x = x + dx * j;
                        let y = y + dy * j;
                        if !(x < 8 && y < 8) {
                            break;
                        }
                        if bit(place, pos(x, y)) == 1 || bit(place, pos(x, y)) == 1 {
                            return false;
                        }
                        state |= 1 << pos(x, y);
                    }
                }
            }
            if knight.bytes().any(|s| s == c) {
                let mut dir = (1, 2);
                for _ in 0..2 {
                    for _ in 0..4 {
                        let x = x + dir.0;
                        let y = y + dir.1;
                        dir = (dir.1, !dir.0 + 1);
                        if x < 8 && y < 8 {
                            if bit(place, pos(x, y)) == 1 {
                                return false;
                            }
                            state |= 1 << pos(x, y);
                        }
                    }
                    dir = (dir.1, dir.0);
                }
            }
            !rec((state, place | (1 << i), k + 1))
        })
    });
    let ans = if calc((0, 0, 0)) {
        "Alice"
    } else {
        "Bob"
    };
    println!("{}", ans);
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// ---------- begin recurse ----------
// reference
// https://twitter.com/noshi91/status/1393952665566994434
// https://twitter.com/shino16_cp/status/1393933468082397190
pub fn recurse<A, R, F>(f: F) -> impl Fn(A) -> R
where
    F: Fn(&dyn Fn(A) -> R, A) -> R,
{
    fn call<A, R, F>(f: &F, a: A) -> R
    where
        F: Fn(&dyn Fn(A) -> R, A) -> R,
    {
        f(&|a| call(f, a), a)
    }
    move |a| call(&f, a)
}
// ---------- end recurse ----------