#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
pair<long long int, long long int> s4[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
pair<long long int, long long int> s8[8] = {
    {-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}};
void judge() {}
long long int gcd(long long int a, long long int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
void solve() {
  long long int n;
  cin >> n;
  long long int mx = 0, g = 0;
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    mx = max(mx, x);
    g = gcd(g, x);
  }
  long long int tmp = (mx / g - n) % 2;
  if (tmp & 1) {
    cout << "Alice\n";
  } else {
    cout << "Bob\n";
  }
}
signed main() {
  judge();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  solve();
}
