#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010;//10^18 = 2^60
int INF = 2000000000;//10^9
ll MOD  = 998244353;
//素数判定O(√n)
bool Prime(ll n){
    if(n <= 1){
        return 0;
    }
    bool a = true;
    for(int i = 2; i * i <= n; i++){
        if(n % i == 0){
            a = false;
        }
    }
    return a;
}

//素因数分解O(√n)
vector<pair<ll, int>> MakePrimeList(ll x){
    vector<pair<ll, int>> PrimeList;
    for(int i = 2; i < 32000; i++){
        if(Prime(i) == 0) continue;
        int cnt = 0;
        while(x % i == 0){
            cnt++;
            x /= i;
        }
        if(cnt){
            PrimeList.push_back({i, cnt});
        }
    }
    if(Prime(x)){
        PrimeList.push_back({x, 1});
    }
    return PrimeList;
}

int main() {
    int N;
    cin >> N;
    int XOR = -1;
    for(int i = 0; i < N; i++){
        int M;
        cin >> M;
        vector<pair<ll, int>> P = MakePrimeList(M);
        vector<int> g(0);
        for(int i = 0; i < P.size(); i++){
            g.push_back(P.at(i).second % 3);
        }
        for(int i = 0; i < g.size(); i++){
            if(XOR == -1){
                XOR = g.at(0);
            }else{
                XOR = XOR xor g.at(i);
            }
        }
    }
    if(XOR){
        cout << "Alice" << endl;
    }else{
        cout << "Bob" << endl;
    }
    
}