#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
struct data {
  int e1, e2;
  data() {}
  data(int a, int b) { e1 = a, e2 = b; }
  bool friend operator<(data a, data b) { return a.e1 > b.e1; }
};
int n, m, k;
long long N, M, K;
int a[100005];
int main() {
  int t, tc = 1;
  scanf("%d", &n);
  int cnt = 0;
  int mx = 0;
  int even = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    even = gcd(even, a[i]);
    mx = max(mx, a[i]);
  }
  sort(a, a + n);
  mx = mx / even;
  int res = mx - n;
  if (res % 2)
    printf("Alice\n");
  else
    printf("Bob\n");
  return 0;
}
