from collections import Counter
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n = n//i
      table.append(i)
    i += 1
  if n > 1:
    table.append(n)
  return table

N = int(input())
prime = prime_decomposition(N)
d = Counter()
d.update(prime)

cnt_one = 0
cnt_multi = 0
for key in d:
    if d[key] > 1:
        cnt_multi += 1
    else:
        cnt_one += 1

if cnt_one%2:
    if cnt_multi == 0 or cnt_multi%2:
        print("Alice")
    else:
        print("Bob")
else:
    if cnt_multi%2:
        print("Alice")
    else:
        print("Bob")