#include <bits/stdc++.h>
using namespace std;
using int64 = long long;

// returns true if the player to move, holding 'a' while the opponent holds 'b', has a winning strategy
bool win(int64 a, int64 b) {
    bool rev = false;  // counts how many “turn‐swaps” we did
    bool res = false;  // what the eventual base‐case says

    while (true) {
        // keep a >= b
        if (a < b) swap(a, b);

        // now a >= b > 0
        int64 q = a / b;
        int64 r = a % b;

        if (r == 0) {
            // you can divide exactly to 0 ⇒ win immediately
            res = true;
            break;
        }
        if (q >= 2) {
            // forced mod with q>=2 hands a winning position to opponent ⇒ you lose
            res = false;
            break;
        }
        // q == 1, r > 0: only move is (a,b)→(b,r) and it's opponent's turn
        a = b;
        b = r;
        rev = !rev;
    }

    // if we swapped an odd number of times, invert the base‐case result
    return rev ? !res : res;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int64 A, B;
    cin >> A >> B;
    cout << (win(A, B) ? "Alice\n" : "Bob\n");
    return 0;
}