import Control.Applicative
import Control.Monad
import Numeric
import Text.Printf

sieve = 2:3:[6*i+j|i<-[1..],j<-[-1,1], isPrime $ 6*i+j] where
  isPrime n = null [p|p<-takeWhile (\x -> x*x <=n) sieve, rem n p == 0]

primeVector n = go n sieve [0] where
  go 1 _ acc = reverse acc
  go k (p:ps) (a:acc)
    | k `mod` p == 0 = go (k `div` p) (p:ps) (a+1:acc)
    | otherwise = go k ps (0:a:acc)

solve n = if solve' n then "Bob" else "Alice"

solve' n = check $ fmap go $ primeVector n where
  go :: Int -> String
  go x = printf "%010d" $ (read :: String -> Int) $ showIntAtBase 2 (head . show) x ""
  
  check ps
    | all (== "") ps = True
    | otherwise = ((sum $ fmap (read . return . (!! 0)) ps) `mod` 2 == 0) && check (fmap tail ps)

main = do
  n <- (read :: String -> Int) <$> getLine
  putStrLn $ solve n