#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e6 + 1, INF = 1e9 + 1;
long long i, j, k, n, m, answer, l;
vector<long long> a;
long long gcd(long long first, long long second) {
  if (second == 0) {
    return first;
  }
  return gcd(second, first % second);
}
int main() {
  cin >> n;
  for (i = 0; i < n; ++i) {
    cin >> k;
    if (i == 0) {
      l = k;
    } else {
      l = gcd(max(l, k), min(l, k));
    }
    answer = max(answer, k);
  }
  answer = answer / l - n;
  if (answer % 2 == 1) {
    cout << "Alice";
  } else {
    cout << "Bob";
  }
}
