import collections
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())
A = prime_factorize(N)
c = collections.Counter(A)
ans = 1
for j in c.most_common():
    ans ^ j[1]
if ans !=0:
    print('Alice')
else:
    print('Bob')