import math
import collections

def factorize(n):
    ''' returns a list of prime factors of n.
    ex. factorize(24) = [2, 2, 2, 3]
    source: Rossetta code: prime factorization (slightly modified)
    http://rosettacode.org/wiki/Prime_decomposition#Python:_Using_floating_point
    '''
    step = lambda x: 1 + (x<<2) - ((x>>1)<<1)
    maxq = int(math.floor(math.sqrt(n)))
    d = 1
    q = n % 2 == 0 and 2 or 3
    while q <= maxq and n % q != 0:
        q = step(d)
        d += 1
    return q <= maxq and [q] + factorize(n//q) or [n]

def solve(N):
    facs = factorize(N)
    facs = collections.Counter(facs)
    facs = list(facs.values())
    facs.sort()
    return f(facs)

memo = dict()
def f(facs):
    global memo
    facs.sort()
    if facs[0] == 0:
        facs = facs[1:]
    facs_tuple = tuple(facs)
    if facs_tuple in memo:
        return memo[facs_tuple]
    if len(facs_tuple) == 1:
        memo[facs_tuple] = True
        return True
    for i, fac in enumerate(facs_tuple):
        for j in range(fac):
            new_facs = facs[:i] + [j] + facs[i + 1:]
            if not f(new_facs):
                memo[facs_tuple] = True
                return True
    memo[facs_tuple] = False
    return False

if __name__ == '__main__':
    N = int(input())
    if solve(N):
        print('Alice')
    else:
        print('Bob')