def Sieve(n): #n以下の素数全列挙(O(nloglogn)) retは素数が入ってる。divlisはその数字の素因数が一つ入ってる

    ret = []
    divlis = [-1] * (n+1) #何で割ったかのリスト(初期値は-1)
    
    flag = [True] * (n+1)
    flag[0] = False
    flag[1] = False

    ind = 2
    while ind <= n:

        if flag[ind]:
            ret.append(ind)

            ind2 = ind ** 2

            while ind2 <= n:
                flag[ind2] = False
                divlis[ind2] = ind
                ind2 += ind

        ind += 1

    return ret,divlis


N = int(input())

ret,divs = Sieve(10000)

ans = 0

for i in ret:

    now = 0

    while N % i == 0:
        N //= i
        now += 1

    ans ^= now

if N != 1:
    ans ^= 1

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