#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first //pairの一つ目の要素  //遅延セグ木使うときは注意
#define S second //pairの二つ目の要素  //遅延セグ木使うときは注意
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
//V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using Pl = pair<ll, ll>;
using Vs = vector<string>;
const ll mod = 998244353;
const ll inf = 1000000000000000000;//10の18乗
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
vector<pair<ll,ll>> factor(ll x){
    ll xx=x;
    vector<pair<ll,ll>> ret;
    rrep(i,2,sqrt(x)+1){
        if(xx%i==0){
            ret.PB({i,0});
        }
        while(xx%i==0){
            xx/=i;
            ret[ret.size()-1].S++;
        }
    }
    if(xx!=1) ret.PB({xx,1});
    return ret;
}

int main(){
    ll n;
    cin >> n;
    Vl v(n);
    rep(i,n) cin >> v[i];
    ll now=0;
    rep(i,n){
        auto fac=factor(v[i]);
        for(auto p:fac){
            now=now^(p.S%3);
        }
    }
    if(now==0){
        cout << "Bob" << endl;
    }
    else{
        cout << "Alice" << endl;
    }
}