def factorize(n):
    p = 2
    while p * p <= n:
        while n % p == 0:
            yield p
            n //= p
        p += 1
    if n > 1:
        yield n


N = int(input())
ps = set(factorize(N))


def f(turn, n: int) -> bool:
    if n == 1:
        return False

    res = False
    for p in ps:
        x = n
        while x % p == 0:
            x //= p
            res |= not f(turn ^ 1, x)

    return res


if f(0, N):
    print('Alice')
else:
    print('Bob')