#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int a[110];
int main() {
  int n;
  scanf("%d", &n);
  int d;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  d = a[0];
  for (int i = 0; i < n; i++) d = gcd(d, a[i]);
  for (int i = 0; i < n; i++) a[i] /= d;
  int mx = 0;
  for (int i = 0; i < n; i++) mx = max(mx, a[i]);
  int ans = mx - n;
  if (ans % 2 == 1)
    printf("Alice\n");
  else
    printf("Bob\n");
}
