import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy

def solve(n):
  i = 2
  x = 0
  while i * i <= n:
    e = 0
    while n % i == 0:
      n /= i
      e += 1      
    i += 1
    x ^= e
  if n > 1:
    x ^= 1
  return True if x > 0 else False

n = int(input())
print("Alice" if solve(n) else "Bob")