#include <bits/stdc++.h>
using namespace std;

vector<pair<int, int>> prime_factorize(int n) {
    vector<pair<int, int>> ret;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            int num = 0;
            while (n % i == 0) {
                num++;
                n /= i;
            }
            ret.push_back({i, num});
        }
    }
    if (n != 1)
        ret.push_back({n, 1});
    return ret;
}

int main() {
    int N, grundy = 0;
    cin >> N;
    while (N--) {
        int M;
        cin >> M;
        auto V = prime_factorize(M);
        for (auto& p : V) {
            grundy ^= p.second % 3;
        }
    }

    if (grundy)
        cout << "Alice" << endl;
    else
        cout << "Bob" << endl;
}