import sys
from operator import itemgetter
from collections import defaultdict, deque
import heapq
from heapq import heapify, heappop, _heapify_max, heappush
from bisect import bisect_left, bisect_right
import math
import itertools
import copy

stdin=sys.stdin
#sys.setrecursionlimit(10 ** 7)
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')

ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
Yp=lambda:print('Yes')
Np=lambda:print('No')
inf = 1 << 60
mod = 10 ** 9 + 7
mod = 998244353
eps = 1e-9
sortkey1 = itemgetter(0)
sortkey2 = lambda x: (x[0], x[1])
# sort(key=lambda x:(x[1], x[2]))


###############################################################

N = ip()
NN = N
factors = set()
soin = set()
for i in range(2, N + 1):
    if i * i > N:
        break
    if N % i == 0:
        factors.add(i)
        factors.add(N//i)
    if NN % i == 0:
        soin.add(i)
        while NN % i == 0:
            NN //= i
NN = N
for f in soin:
    if NN % f == 0:
        NN //= f
if NN == N:
    soin.add(N)
factors.add(N)
factors = list(factors)
factors.sort()
grundy = defaultdict(int)
grundy[1] = 0

for fac in factors:
    mex = set()
    for f in soin:
        if fac % f == 0:
            ffac = fac
            while ffac % f == 0:
                mex.add(grundy[ffac//f])
                ffac //= f
    for i in range(1000):
        if i not in mex:
            x = i
            break
    grundy[fac] = x

if grundy[N]:
    print('Alice')
else:
    print('Bob')