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