#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
int in[105];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &in[i]);
  int cur_gcd = in[0];
  for (int i = 1; i < n; i++) cur_gcd = gcd(cur_gcd, in[i]);
  for (int i = 0; i < n; i++) in[i] /= cur_gcd;
  int maxx = 0;
  for (int i = 0; i < n; i++) {
    maxx = max(maxx, in[i]);
  }
  if ((maxx - n) % 2)
    printf("Alice\n");
  else
    printf("Bob\n");
  return 0;
}
