def factorization(n):
    if n==1:
        return []
    arr = []
    tmp = n
    for i in range(2,4):
        if tmp%i==0:
                cnt=0
                while(tmp%i==0):
                    cnt+=1
                    tmp//=i
                arr.append(cnt)
    for i in range(5, int(-(-tmp**0.5//1))+1,2):
        if tmp%i==0:
            cnt=0
            while tmp%i==0:
                cnt+=1
                tmp //= i
            arr.append(cnt)

    if tmp!=1:
        arr.append(1)

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

    return arr
n=int(input())
prime=factorization(n)
ans=0
for x in prime:
    ans^=x
if ans:
    print("Alice")
else:
    print("Bob")