import sys
sys.setrecursionlimit(10**7)
from functools import lru_cache

@lru_cache(None)
def win(a: int, b: int) -> bool:
    # ensure a >= b by swapping if needed
    if a < b:
        return not win(b, a)
    # if mod‐move kills your pile, you win instantly
    if a % b == 0:
        return True

    # 1) try the mod‐move → (b, a % b)
    r = a % b
    if not win(b, r):
        return True

    # 2) try the decrement‐move → (b, a-1)
    #    opponent sees (b, a-1), so we win if that state is losing
    if a - 1 < b:
        # roles swap again inside win()
        if not win(a - 1, b):
            return True
    else:
        if not win(b, a - 1):
            return True

    # no winning move
    return False

def main():
    A, B = map(int, sys.stdin.read().split())
    print("Alice" if win(A, B) else "Bob")

if __name__ == "__main__":
    main()