#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
int inf=1000000000;
using mint=modint1000000007;



vector<ll> primes(ll n){
    vector<ll> ans;
    vector<bool> isprime(n+1,true);

    for(int i=2;i<=n;i++){
        if(!isprime[i])continue;
        else{
            ans.push_back(i);
            for(int j=2;j<=n/i;j++){
                isprime[i*j]=false;
            }
        }
    }

    return ans;
    
}

vector<int> grundy(15,-1);
int g(int i){
    if(grundy[i]!=-1)return grundy[i];
    int a=-1,b=-1;
    if(i>1)a=g(i-2);
    if(i>0)b=g(i-1);
    if(a!=0&&b!=0)return grundy[i]=0;
    else if(a!=1&&b!=1)return grundy[i]=1;
    else return grundy[i]=2;
}
int main()
{
    int n;
    cin>>n;
    vector<ll> prime=primes(10000);
    int ans=0;
    for(int i=0;i<n;i++){
        int m;
        cin>>m;
        for(int p:prime){
            if(m%p==0){
                int counter=0;
                while(m%p==0){
                    m/=p;
                    counter++;
                }
                ans^=g(counter);
                
            }
            
            if(m==1)break;
        }
    }

    if(ans)cout<<"Alice"<<endl;
    else cout<<"Bob"<<endl;
}