#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long mod = 1e9 + 7;
long long GCD(long long x, long long y) {
  if (!y) return x;
  return GCD(y, x % y);
}
void solve() {
  long long n, m = 0, k = 0, i = 1, j, p = 1e9, f, x, y;
  long long ans = 0, sum = 0;
  cin >> n;
  cin >> x;
  m = x;
  for (i = 1; i < n; i++) {
    cin >> y;
    x = GCD(x, y);
    m = max(m, y);
  }
  (m / x - n) % 2 == 1 ? cout << "Alice" : cout << "Bob", cout << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
