#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5, INF = 2e9;
vector<int> v;
int n;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end());
  int g = v[0];
  for (int i = 0; i < n; ++i) {
    g = gcd(g, v[i]);
  }
  for (int i = 0; i < n; ++i) {
    v[i] /= g;
  }
  int free_slots = v[v.size() - 1] - v.size();
  if (free_slots % 2 == 0)
    cout << "Bob" << endl;
  else
    cout << "Alice" << endl;
  return 0;
}
