# 素因数分解のリストを返す
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
li=prime_factorize(n)
c=Counter(li)

xor=0
for x in c.values():
    xor^=x
if xor:
    print("Alice")
else:
    print("Bob")