#include <bits/stdc++.h>
using namespace std;
map<long long, int> p;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  int n, k, c, l, r, d;
  long long x, m;
  while (cin >> n) {
    m = 0;
    c = 0;
    l = 0;
    r = 0;
    p.clear();
    k = 0;
    while (n--) {
      cin >> x;
      if (m == 0)
        d = x;
      else
        d = gcd(d, x);
      m = max(m, x);
      if (p[x] == 0)
        c++;
      else
        k = 1;
      if (x % 2)
        l = 1;
      else
        r = 1;
      p[x] = 1;
    }
    if (d == 1) {
      if ((m - c) % 2 == 0 && k == 0 || ((m - c) % 2 && k))
        cout << "Bob\n";
      else
        cout << "Alice\n";
    } else {
      if ((m / d - c) % 2 == 0 && k == 0 || (m / d - c) % 2 && k)
        cout << "Bob\n";
      else
        cout << "Alice\n";
    }
  }
}
