use std::collections::HashMap;


fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    
    let mut nval = n;
    let mut primes = HashMap::new();
    for i in 2..=(n as f64).sqrt().floor() as usize {
        while nval % i == 0 {
            *primes.entry(i).or_insert(0usize) += 1;
            nval /= i;
        }
    }
    if nval > 1 { primes.insert(nval, 1); }
    let result = primes.values().fold(0usize, |x, &y| x ^ y);
    if result == 0 {
        println!("Bob");
    } else {
        println!("Alice");
    }
}