#include <bits/stdc++.h>
using namespace std;
int n;
int box[101];
int aox[101];
int minn = 2147480000;
int maxn = -1;
int gcd(int a, int b) {
  while (b != 0) {
    int r = b;
    b = a % b;
    a = r;
  }
  return a;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> box[i];
    maxn = max(box[i], maxn);
  }
  sort(box + 1, box + 1 + n);
  for (int i = 1; i <= n; i++) {
    aox[i] = box[i] - box[i - 1];
  }
  int a = gcd(aox[1], aox[2]);
  for (int i = 3; i <= n; i++) {
    a = gcd(a, aox[i]);
  }
  int b = maxn - a;
  b = b / a + 1;
  int c = b - n;
  if (c % 2 == 0)
    cout << "Bob" << endl;
  else
    cout << "Alice" << endl;
  return 0;
}
