def factorization(n):
    arr = []
    if n==1:
        return arr
    tmp = n
    def judge(i:int,N:int):
        if N%i==0:
            cnt=0
            while(N%i==0):
                cnt+=1
                N//=i
            arr.append(cnt)
        return N
    tmp=judge(2,tmp)
    tmp=judge(3,tmp)
    i=6
    while((i-1)**2<=tmp):
        tmp=judge(i-1,tmp)
        tmp=judge(i+1,tmp)
        i+=6
    if tmp!=1:
        arr.append(1)

    if arr==[]:
        arr.append(1)

    return arr

n=int(input())

primes=factorization(n)
ans=0
for x in primes:
    ans^=x
if ans:
    print("Alice")
else:
    print("Bob")