import sys
def I(): return int(sys.stdin.readline().rstrip())


def prime_factorization(n):  # nの素因数分解
    res = {}
    for i in range(2,int(n**.5)+1):
        if n % i == 0:
            r = 0  # nがiで何回割り切れるか
            while n % i == 0:
                n //= i
                r += 1
            res[i] = r
    if n != 1:
        res[n] = 1
    return res


N = I()
X = prime_factorization(N).values()
a = 0
for x in X:
    a ^= x

if a == 0:
    print('Bob')
else:
    print('Alice')