#include <bits/stdc++.h>
const int NMAX = 1010;
int n, arr[NMAX];
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  int max = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", arr + i);
    if (arr[i] > max) max = arr[i];
  }
  int temp = arr[0];
  for (int i = 1; i < n; i++) temp = gcd(temp, arr[i]);
  int sum = max / temp - n;
  if (sum & 1)
    puts("Alice");
  else
    puts("Bob");
}
int main() {
  while (scanf("%d", &n) != EOF) {
    solve();
  }
  return 0;
}
