#!/usr/bin/env python3


def memoize(fn):
    table = {}

    def func(*args):
        if args not in table:
            table[args] = fn(*args)
        return table[args]
    return func


def prime():
    i = 2
    while True:
        if isPrime(i):
            yield(i)
        i += 1


@memoize
def isPrime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    pg = prime()
    while True:
        p = next(pg)
        if p ** 2 > n:
            return True
        elif n % p == 0:
            return False


def prime_factorization(n):
    factor = {}
    pg = prime()
    while n > 1:
        p = next(pg)
        while n % p == 0:
            n = int(n / p)
            if p in factor:
                factor[p] += 1
            else:
                factor[p] = 1
    return factor


@memoize
def nim(nums):
    if sum(nums) == 0:
        True
    for i in range(len(nums)):
        for n in range(1, nums[i] + 1):
            tmp = list(nums)
            tmp[i] -= n
            if nim(tuple(sorted(tmp))):
                return False
    return True

N = int(input())
if nim(tuple(prime_factorization(N).values())):
    print("Bob")
else:
    print("Alice")