#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const long long mod = 1e9 + 7;
const int oo = 1e9;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int n;
int t[N];
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  scanf("%d", &n);
  int mx = -1;
  int g;
  for (int i = 0; i <= n - 1; i++) {
    scanf("%d", &t[i]);
    mx = max(mx, t[i]);
  }
  g = mx;
  for (int i = 0; i <= n - 1; i++) {
    g = gcd(t[i], g);
  }
  int ans = (mx / g) - n;
  if (ans % 2 == 0)
    printf("Bob");
  else
    printf("Alice");
}
