#include <bits/stdc++.h>
using namespace std;
int n, A[110], maxi, x, gcd, res;
int GCD(int a, int b) {
  if (a % b == 0) return b;
  return GCD(b, a % b);
}
int main() {
  while (cin >> n) {
    cin >> gcd;
    maxi = gcd;
    for (int I = 1; I < n; ++I) {
      cin >> x;
      gcd = GCD(max(gcd, x), min(gcd, x));
      maxi = max(maxi, x);
    }
    res = (maxi / gcd) - n;
    if (res % 2)
      cout << "Alice" << endl;
    else
      cout << "Bob" << endl;
  }
  return 0;
}
