#include <iostream>
#include <map>
#include <set>
using namespace std;

const int MAX_M = 10010;

int grundy[MAX_M];

map<int, int> prime_factorization(int n) {
    map<int, int> res;
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            res[i]++;
            n /= i;
        }
    }
    if (n != 1) res[n]++;
    return res;
}

int main() {
    for (int num = 2; num < MAX_M; num++) {
        set<int> s;
        auto factor = prime_factorization(num);
        for (auto it = factor.begin(); it != factor.end(); it++) {
            auto next = num / it->first;
            s.insert(grundy[next]);
            if (it->second >= 2) s.insert(grundy[next / it->first]);
        }

        int g = 0;
        while (s.count(g) != 0) g++;
        grundy[num] = g;
    }

    int n, res = 0;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int m;
        cin >> m;
        res ^= grundy[m];
    }

    if (res) cout << "Alice" << endl;
    else cout << "Bob" << endl;

    return 0;
}