#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
const int maxn = 4e5 + 100;
const int mod = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  int maxx = 0;
  int g = 1;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (i == 0)
      g = x;
    else
      g = gcd(x, g);
    maxx = max(maxx, x);
  }
  int k = maxx / g - n;
  if (k % 2 == 0)
    cout << "Bob" << endl;
  else
    cout << "Alice" << endl;
  return 0;
}
