import sys
def main():
    A, B = map(int, sys.stdin.read().split())

    # inv = whether we swapped A,B once initially (to ensure A>=B)
    inv = False
    if A < B:
        A, B = B, A
        inv = True

    turn = True    # True means “the player who started on (A,B)”
    a, b = A, B

    while True:
        q, r = divmod(a, b)
        # If r==0, the current player can do a % b → 0 and win.
        # If q>1, the current player can repeat the mod move enough times
        # to force the same win.
        if r == 0 or q > 1:
            result = turn
            break
        # Otherwise q==1: the only legal “mod” move is a→r, which swaps piles
        # and hands the turn to the opponent.
        a, b = b, r
        turn = not turn

    # If we did an initial swap, flip the result back
    if inv:
        result = not result

    sys.stdout.write("Alice\n" if result else "Bob\n")

if __name__ == "__main__":
    main()