import math
max = input()
max2 = max+1
sieve = [True]*max2
t = 0
while max % 2 == 0:
  max /= 2
  t += 1
x = [t]
for i in range(int((max-3)/2)+1):
  if not sieve[i]: continue
  k = i+i+3
  t = 0
  while max % k == 0:
    max /= k
    t += 1
  x.append(t)
  if max == 1: break
  j = k*(i+1)+i
  while j < max2:
    sieve[j] = False
    j += k
print "Alice" if reduce(lambda i,j:i^j,x)>0 else "Bob"