#include <bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define pii pair<int,int>
#define pll pair<ll,ll>

#define rep(i,num,n) for(int i=num;i<(int)(n);i++) //for_loop
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,num,n) for(int i=num-1;i>=(int)(n);i--) //reverse_for>
#define in(x,a,b) (a<=x && x<b)//範囲
#define reo return 0
#define all(v) v.begin(),v.end()

#define INFI 1010000000
#define INFL 4000000000000000000
//#define ten(x) ((int)1e##x)
//#define tenll(x) ((ll)1e##x)
#define PI 3.14159265358979
//#define mint modint1000000007
#define mint modint998244353

bool chmin(ll &a,ll b){if(a>b){a=b;return true;}return false;}
bool chmax(ll &a,ll b){if(a<b){a=b;return true;}return false;}
bool chmin(int &a,int b){if(a>b){a=b;return true;}return false;}
bool chmax(int &a,int b){if(a<b){a=b;return true;}return false;}

int dx[]={0,0,1,-1};int dy[]={1,-1,0,0};
//int dx[]={1,1,1,0,0,-1,-1,-1},dy[]={1,0,-1,1,-1,1,0,-1};
//----------------------------
ll n;
int main(){
    cin>>n;

    vector<map<int,int>>fact(n);
    vector<ll>a(n);
    rep(i,0,n)cin>>a[i];
    rep(j,0,n){
            for(ll i=2;i*i<=a[j];i++){
            if(a[j]%i==0)while(a[j]%i==0){
                fact[j][i]++;
                a[j]/=i;
            }
        }
        if(a[j]!=1)fact[j][a[j]]++;
    }
    ll x=0;
    rep(i,0,n){
        ll grundy=0;
        for(auto[key,val]:fact[i]){
        //valを1 or 2減らす不偏ゲーム。
        //grundyは0,1,2,0,1,2...と推移.
        int v=val%3;
        grundy^=v;
        }
        x^=grundy;
    }


    if(x)cout<<"Alice";
    else cout<<"Bob";
    reo;
}