#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))

// 素因数分解
vector<pair<int,int> > pdecomp(unsigned int n){
    vector<pair<int,int> > res;
    unsigned int e = 0; while(n % 2 == 0){ n /= 2, e++; }
    if(e) res.push_back(make_pair(2,e));
    for(unsigned int p = 3; p*p <= n; p += 2){
        unsigned int e = 0; while(n % p == 0){ n /= p, e++; }
        if(e) res.push_back(make_pair(p,e));
    }
    if(n != 1) res.push_back(make_pair(n,1));
    return res;
}

int main(){
    int N, M;
    int K = 0;
    cin >> N;
    REP(i,N){
        cin >> M;
        vector<pair<int,int> > m = pdecomp(M);
        for(auto v : m){
            int k = v.second;
            K ^= k % 3;
        }
    }
    if(K){
        cout << "Alice" << endl;
    } else {
        cout << "Bob" << endl;
    }
}