import sys
sys.setrecursionlimit(1000000)
n = int(input())

cache = {}

def winning_move(l):
    if all(x == 1 for x in l):
        return -1
    t = tuple(sorted(l))
    if t in cache:
        return cache[t]
    wm = 0
    for i, x in enumerate(l):
        for j in range(1, x):
            wm = winning_move(l[:i] + [j, x-j] + l[i+1:])
            if wm == -1:
                cache[t] = j
                return j
    else:
        cache[t] = -1
        return -1
    

wm = winning_move([n])
if wm == -1:
    print("Bob")
else:
    print("Alice")
    print(wm)