#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>,
                       greater<pair<int, int>>>
    rpqpi;
int gcd(int big, int small) {
  if (big % small == 0) return small;
  return gcd(small, big % small);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, p;
  cin >> n;
  vector<int> a(n);
  cin >> a[0];
  p = a[0];
  for (int i = 1; i < n; ++i) {
    cin >> a[i];
    p = gcd(p, a[i]);
  }
  for (int i = 0; i < n; ++i) {
    a[i] /= p;
  }
  sort(a.rbegin(), a.rend());
  a[0] -= n;
  if (a[0] & 1)
    cout << "Alice" << '\n';
  else
    cout << "Bob" << '\n';
  return 0;
}
