#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)s; i < (int)e; ++i)
#define all(a) (a).begin(), (a).end()

vector<pair<ll, ll>> prime_factorize(ll n) {
    vector<pair<ll, ll>> res;
    for (ll i = 2; i * i <= n; i++) {
        if (n % i != 0) continue;
        ll ex = 0;
        
        while (n % i == 0) {
            ex++;
            n /= i;
        }
        
        res.push_back(make_pair(i, ex));
    }
    
    if (n != 1) res.push_back(make_pair(n, 1));
    return res;
}

int main() {
    cin.tie(nullptr);
    
    int N;
    cin >> N;
    
    ll grundy = 0;
    rep(i, 0, N) {
        ll M;
        cin >> M;
        
        vector<pair<ll, ll>> primes = prime_factorize(M);
        int siz = primes.size();
        
        rep(j, 0, siz) grundy ^= primes[j].second % 3;
    }
    
    if (grundy == 0) cout << "Bob\n";
    else cout << "Alice\n";
}