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

n = int(input())

from collections import Counter
c = Counter(prime_factorize(n))
li = []
for key in c:
    li.append(c[key])
cri = 0
for i in li:
    cri^=i
if cri==0:
    print("Bob")
else:
    print("Alice")