import collections

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def n_fact(N):
    c = collections.Counter(prime_factorize(N))
    return c

N = int(input())
D = n_fact(N)
x = 0
if len(D) == 1:
    print("Alice")
    exit()
for v in D.values():
    x ^= v
if x == 0:
    print("Bob")
else:
    print("Alice")