#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;

const int MAXN = 10010;

map<ll, int> bunkai(ll N) {
    map<ll, int> ret;
    for (ll i = 2; i * i <= N; i++) {
        if (N % i == 0) {
            while (N%i == 0) {
                ret[i]++;
                N /= i;
            }
        }
    }
    if (N>1) ret[N]++;
    return ret;
}

int g[MAXN];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> nums;
    for (int i = 0; i < N; i++) {
        int M;
        cin >> M;
        auto m = bunkai(M);
        for (auto p : m) {
            nums.push_back(p.second);
        }
    }
    int m = nums.size();
    for (int i = 0; i < m; i++) {
        set<int> S;
        for (int minus = 1; minus <= 2; minus++) {
            int x = 0;
            if (nums[i]-minus < 0) continue;
            for (int j = 0; j < m; j++) {
                if (j != i) x ^= nums[j];
                else x ^= (nums[i]-minus);
            }
            S.insert(x);
        }
        int cur = 0;
        for (int el : S) {
            if (el <= cur) cur = el+1;
            else break;
        }
        g[i] = cur;
    }
    int x = 0;
    for (int i = 0; i < m; i++) {
        x ^= g[i];
    }
    if (x == 0) cout << "Bob" << endl;
    else cout << "Alice" << endl;
    return 0;
}