// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

template <typename T>
vector<T> list_prime(T n){
  vector<T> res;
  vector<bool> i_prime = vector<bool>(n+1, true);
  for(ll i = 2; i <= n; i++){
    if(i_prime[i]){
      res.push_back(i);
      for(ll j = 2; j * i <= n; j++){
        i_prime[i * j] = false;
      }
    }
  }
  return res;
}

int g[10001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  auto p = list_prime(10000);
  g[0] = 0;
  for(int i = 1; i <= 10000; i++){
    g[i] = 0;
    set<int> st;
    FOR(j, 1, 3){
      if(i - j < 0)continue;
      st.insert(g[i-j]);
    }
    int k = 0;
    while(true){
      if(st.find(k) == st.end()){
        g[i] = k;
        break;
      }
      k++;
    }
  }
  //rep(i, 10)cout << g[i] << "\n "[i + 1 != 10];
  int n;
  cin >> n;
  vector<int> m(n);
  cin >> m;
  //rep(i, n)cout << m[i] << "\n "[i + 1 != n];
  int res = 0;
  rep(i, n){
    for(int j = 0; j < sz(p); j++){
      if(m[i] % p[j] == 0){
        int cnt = 0;
        int tmp = m[i];
        while(tmp % p[j] == 0){
          cnt++;
          tmp /= p[j];
        }
        res ^= g[cnt];
      }
    }
  }
  if(res == 0)cout << "Bob" << endl;
  else cout << "Alice" << endl;
	return 0;
}