#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
void solve() {
  int n;
  cin >> n;
  vector<long long> f(n);
  long long m = INT_MIN;
  for (int i = 0; i < n; i++) {
    cin >> f[i];
    m = max(m, f[i]);
  }
  long long g = f[0];
  for (int i = 1; i < n; i++) {
    long long a = max(g, f[i]);
    long long b = min(g, f[i]);
    g = gcd(a, b);
  }
  long long t = (m) / g;
  if ((n - t) % 2 == 0) {
    cout << "Bob" << endl;
  } else {
    cout << "Alice" << endl;
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
