#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
int a[110];
int main() {
  int i, j, n, m;
  while (scanf("%d", &n) != EOF) {
    int Max = 0;
    for (i = 1; i <= n; i++) cin >> a[i];
    sort(a, a + 1 + n);
    int res = a[n];
    for (i = 1; i < n; i++)
      for (j = i + 1; j <= n; j++) {
        res = gcd(res, gcd(a[i], a[j]));
      }
    int x = (a[n] / res) - n;
    if (x % 2 == 0)
      cout << "Bob" << endl;
    else
      cout << "Alice" << endl;
  }
  return 0;
}
