#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int memo[11111];

int grundy(int x){
    if(x == 1) return 0 ;
    int& ret = memo[x];
    if(ret != -1) return ret;
    int val = 0;
    VI g ;
    int X = x;
    for(int i=2;i<=x;i++){
        if(X % i == 0){
            g.push_back(grundy(x / i));
            if(x / i % i == 0)
                g.push_back(grundy(x / i / i));
            while(X % i == 0) X /= i;
        }
    }
    sort(ALL(g));
    g.erase(unique(g.begin(),g.end()),g.end());
    FOR(i,SZ(g)) {
        if(g[i] == i) val++;
        else break;
    }
    return ret = val;
}

int main()
{
    int N;
    cin>>N;
    VI M(N);
    FOR(i,N) cin>>M[i];
    int g = 0;
    memset(memo , -1 , sizeof(memo));
    FOR(i,N) g ^= grundy(M[i]);
    puts(g ? "Alice" : "Bob");
    return 0;
}