#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

vector<ll> sosu;
void Sosu(ll x){
    bool s[x+1];
    fill(s,s+x+1,true);
    ll i;
    for(i=2;i*i<=x;i=i+2){
        if(s[i]){
            sosu.pb(i);
            for(ll j=2;j*i<=x;j++){
                s[j*i]=false;
            }
        }
        if(i==2)i--;
    }
    for(i=i;i<=x;i=i+2){
        if(s[i]){
            sosu.pb(i);
        }
    }
}

int main(){fastio
    Sosu(10000);
    ll n;cin>>n;
    ll m[n];rep(i,0,n-1)cin>>m[i];
    ll a[n][sosu.size()];rep(i,0,n-1)rep(j,0,sosu.size()-1)a[i][j]=0;
    ll sum=0;
    rep(i,0,n-1){
        rep(j,0,sosu.size()-1){
            while(m[i]%sosu[j]==0){
                a[i][j]++;
                m[i]/=sosu[j];
            }
        }
        if(m[i]!=1){
            sum++;
        }
    }
    ll ans=sum%2;
    rep(i,0,n-1){
        rep(j,0,sosu.size()-1){
            ans=ans^(a[i][j]%3);
        }
    }
    if(ans==0){
        cout<<"Bob"<<endl;
    }else{
        cout<<"Alice"<<endl;
    }
    
    return 0;
}