import re

def isPrime(n,lst):
  for i in xrange(len(lst)):
    if n%lst[i]==0: return False
    if n<=lst[i]**2: return True

def primes():
  lst=[2]
  n=3
  while True:
    if n > 10**4: break
    if isPrime(n,lst):
      lst.append(n)
    n+=2
  return lst

def breakDown(n):
  lst=primes()
  dic={}
  for i in xrange(len(lst)):
    c=0
    if not n%lst[i]==0: continue
    while True:
      if not n%lst[i]==0: break
      else:
        n/=lst[i]
        c+=1
    dic[lst[i]]=c
  if not n==1: dic[n]=1
  return dic

def judge(n):
  s=bin(n)
  if len(re.findall('1',s))%2==0: print "Bob"
  else: print "Alice"

n=int(raw_input())
ans=0
dic=breakDown(n)
for i in dic.values():
  ans=ans^i
judge(ans)