#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N, M[100];
ll memo[20000];
vector<ll> prime;

ll grundy(ll n) {
  ll &ret = memo[n];
  if(ret >= 0) return ret;
  if(n == 1) return ret = 0;

  set<ll> st;
  for(ll p : prime) {
    ll p1 = p, p2 = p * p;
    if(n % p1 == 0) st.insert(grundy(n / p1));
    if(n % p2 == 0) st.insert(grundy(n / p2));
  }
  ll g = 0;
  while(st.count(g)) g++;
  return ret = g;
}

int main(void) {
  cin >> N;
  REP(i, 0, N) cin >> M[i];

  vector<bool> p(10000, true);
  p[0] = p[1] = false;
  REP(i, 0, 10000) if(p[i]) for(ll j = i + i; j < 10000; j += i) p[j] = false;
  REP(i, 0, 10000) if(p[i]) prime.push_back(i);

  REP(i, 0, 20000) memo[i] = -1;

  ll x = 0;
  REP(i, 0, N) x ^= grundy(M[i]);
  cout << (x != 0 ? "Alice" : "Bob") << endl;
}