#include <iostream>
#include <unordered_set>
#include <vector>

int g[10001], c[10001];
using namespace std;
int main()
{
    vector<int> p;
    for(int i=2;i<10001;++i) if (!c[i]) {
        p.push_back(i);
        for(int j=i+i;j<10001;j+=i) c[j]=1;
    }

    g[1]=0;
    for(int i=2;i<10001;++i) {
        unordered_set<int> s;
        for(int j=0;j<p.size();++j) {
            int c=0,n=i;
            while (c++<2 and n%p[j]==0) { n/=p[j]; s.insert(g[n]); }
        }
        g[i]=0;
        while (s.count(g[i])) ++g[i];
    }

    int n;
    while (cin>>n) {
        int x=0;
        while (n--) { int a; cin>>a; x^=g[a]; }
        cout<<(x ? "Alice" : "Bob")<<endl;
    }
}