#!/usr/bin/env python3
from collections import defaultdict


def memoize(fn):
    table = {}

    def func(*args):
        if args not in table:
            table[args] = fn(*args)
        return table[args]
    return func


def prime_factorization(n):
    factor = defaultdict(int)
    i = 2
    while i * i <= n:
        while n % i == 0:
            n = n // i
            factor[i] += 1
        i += 1
    if n > 1:
        factor[n] += 1
    return factor


@memoize
def nim(nums):
    if sum(nums) == 0:
        True
    for i in range(len(nums)):
        for n in range(1, nums[i] + 1):
            tmp = list(nums)
            tmp[i] -= n
            if nim(tuple(tmp)):
                return False
    return True

N = int(input())
if nim(tuple(prime_factorization(N).values())):
    print("Bob")
else:
    print("Alice")