#include <bits/stdc++.h>
using namespace std;
inline long long gcd(long long a, long long b) {
  long long c;
  while (b) {
    c = b;
    b = a % b;
    a = c;
  }
  return a;
}
int main() {
  int n;
  cin >> n;
  int arr[n];
  cin >> arr[0];
  long long div, mx;
  div = mx = arr[0];
  for (int i = 1; i < n; ++i) {
    cin >> arr[i];
    div = gcd(div, arr[i]);
    mx = mx > arr[i] ? mx : arr[i];
  }
  const long long cnt = (mx / div) - n;
  cout << (cnt % 2 ? "Alice" : "Bob") << endl;
  return 0;
}
