#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;

vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long p = 2; p * p <= N; ++p) {
        if (N % p != 0) {
            continue;
        }
        int e = 0;
        while (N % p == 0) {
            ++e;
            N /= p;
        }
        res.emplace_back(p, e);
    }
    if (N != 1) {
        res.emplace_back(N, 1);
    }
    return res;
}

int main(){
  ll n;
  cin>>n;
  vector<ll> m(n);
  for(ll i=0;i<n;i++){
    cin>>m[i];
  }
  vector<vector<P>> v(n);
  for(ll i=0;i<n;i++){
    v[i]=prime_factorize(m[i]);
  }
  vector<ll> nim;
  for(ll i=0;i<n;i++){
    ll val=0;
    for(ll j=0;j<(ll)v[i].size();j++){
      ll e=v[i][j].second;
      val^=e%3;
    }
    nim.push_back(val);
  }
  ll val=0;
  for(ll i=0;i<n;i++){
    val^=nim[i];
  }
  if(val==0){
    cout<<"Bob"<<endl;
  }else{
    cout<<"Alice"<<endl;
  }
}