from collections import Counter
def PrimeFactorize(N):
    if N==1:
        return []
    p=[]
    i=2
    while i**2<=N:
        if N%i==0:
            p.append(i)
            N//=i
        else:
            i+=1
    if N!=1:
        p.append(N)
    return p

N = int(input())
primes = PrimeFactorize(N)
c = Counter(primes)

xor_sum = 0
for v in c.values():
  xor_sum ^= v

if xor_sum == 0:
  print("Bob")
else:
  print("Alice")