#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

vector<ll> fact, factinv, inv;
ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact.at(0) = fact.at(1) = 1;
    factinv.at(0) = factinv.at(1) = 1;
    inv.at(1) = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact.at(i) = (fact.at(i - 1) * i) % mod;
        inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;
        factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;
    }

}
ll nCk(ll n, ll k) {
    if (n < k) return 0;
    return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;
}
ll nPk(ll n, ll k) {
    if (n < k) return 0;
    return fact.at(n) * (factinv.at(n - k) % mod) % mod;
}
ll p = mod;
ll modPow(long long a, long long n) {
    a %= mod;
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1)) % p;
    long long t = modPow(a, n / 2);
    return (t * t) % p;
}
ll inva(ll N) {
    ll a = N, b = mod, c = 1, d = 0;
    while (b > 0) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        c -= t * d;
        swap(c, d);

    }
    c %= mod;
    if (c < 0)c += mod;
    return c;

}
int main() {

    ll N;
    cin>>N;
    ll an=0;
    rep(i,N){
        ll M;
        cin>>M;
        for(ll j=2;j*j<=M;j++){
            if(M%j==0){
                ll k=0;
                while(M%j==0){
                    k++;
                    M/=j;
                }
                an=an^(k%3);
            }
            
        }
        if(M!=1){
            an=an^1;
        }
    }
    cout<<(an!=0?"Alice":"Bob")<<endl;

}