#include <bits/stdc++.h>
using namespace std;
long long calHcf(long long x, long long y) {
  if (y > x) return calHcf(y, x);
  if (y == 0) return x;
  return calHcf(y, x % y);
}
int main() {
  long long i, n, a[105];
  cin >> n;
  for (i = 0; i < n; ++i) cin >> a[i];
  long long hcf = calHcf(a[0], a[1]);
  for (i = 2; i < n; ++i) hcf = calHcf(hcf, a[i]);
  for (i = 0; i < n; ++i) a[i] = a[i] / hcf;
  sort(a, a + n);
  long long max = a[n - 1];
  long long turns = max - n;
  if (turns % 2 == 0)
    cout << "Bob";
  else
    cout << "Alice";
}
