#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

map<int, int> factorize(int n){
    map<int, int> res;
    for(int i=2; (long long)i*i<=n; ++i){
        while(n%i==0){
            n /= i;
            ++res[i];
        }
    }
    if(n!=1) ++res[n];
    return res;
}

map<int, int> F[10001];

int dp[10001];
int f(int m){
    if(m == 1)return 0;
    int &r = dp[m];
    if(r != -1)return r;
    r = 0;
    set<int> S;
    each(p, F[m]){
        int n = m;
        rep(i,min(2,p.second)){
            n /= p.first;
            S.insert(f(n));
        }
    }
    while(S.count(r))r++;
    return r;
}

int main(){
    FOR(i, 1, 10001)F[i] = factorize(i);
    MEM(dp, -1);
    
    int x = 0, N, M;
    cin >> N;
    rep(i, N){
        cin >> M;
        x ^= f(M);
    }
    puts(x ? "Alice" : "Bob");
}