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