#include <bits/stdc++.h>
using namespace std;
int n;
int a[143];
int mx;
int Gcd(int a, int b) {
  if (b == 0) return a;
  return Gcd(b, a % b);
}
int main(int argc, char const *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  int gcd = a[1];
  for (int i = 2; i <= n; ++i) {
    gcd = Gcd(a[i], gcd);
  }
  for (int i = 1; i <= n; ++i) {
    a[i] /= gcd;
    mx = max(mx, a[i]);
  }
  if ((mx - n) % 2 == 1) {
    printf("Alice\n");
  } else {
    printf("Bob\n");
  }
  return 0;
}
