#include <bits/stdc++.h>
using namespace std;
const int X = 1e5 + 1;
int m[X], t[X];
int ev(int a, int b) {
  int k;
  while (b != 0) {
    k = b;
    b = a % b;
    a = k;
  }
  return a;
}
int main() {
  int i, j, n, cnt = 0, e = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> m[i];
  }
  sort(m, m + n);
  for (i = 0; i < n; i++) {
    e = ev(e, m[i]);
  }
  if ((m[n - 1] / e - n) % 2 == 1) {
    cout << "Alice";
  } else {
    cout << "Bob";
  }
  return 0;
}
