#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, now, t, mx, gcd, m, a[107];
  scanf("%d", &n);
  for (i = 0; i ^ n; i++) {
    scanf("%d", a + i);
  }
  sort(a, a + n);
  mx = gcd = a[0];
  m = 1;
  for (i = 1; i ^ n; i++) {
    if (a[i - 1] != a[i]) {
      mx = mx < a[i] ? a[i] : mx;
      m++;
      now = a[i];
      while (gcd) {
        t = now;
        now = gcd;
        gcd = t % gcd;
      }
      gcd = now;
    }
  }
  mx /= gcd;
  mx -= m;
  printf(mx & 1 ? "Alice\n" : "Bob\n");
  return 0;
}
