import strutils, sequtils, algorithm, math

proc prime_count(n: var int): seq[int] =
  var
    i = 2
    count = 0

  result = newSeq[int](0)
  while i * i <= n:
    count = 0
    while n mod i == 0:
      count += 1
      n = n div i
    if count > 0:
      result.add(count)
    i += 1
  if n > 1:
    result.add(1)
  return

var
  n = readLine(stdin).parseInt()
  k = 0
  winner : string

for c in prime_count(n):
  k = k xor c

winner = if k == 0: "Bob" else: "Alice"


echo(winner)