def prime_factor(n):
    ret = []
    nmax = int(n**0.5 + 1)
    x = n
    for i in range(2, nmax):
        if x % i == 0:
            cnt = 0
            while x % i == 0:
                cnt += 1
                x //= i
            ret.append([i, cnt])
    if x != 1:
        ret.append([x, 1])
    if ret == []:
        ret.append([n, 1])
    return ret


n = int(input())
prime = prime_factor(n)
xor_sum = 0
for x in prime:
    xor_sum ^= x[1]
if (xor_sum != 0):
    print("Alice")
else:
    print("Bob")