#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 grundy(int n) {
    set<int> s;
    if (n == 0) return g[0] = 0;
    if (n == 1) return g[1] = 1;
    for (int i = 1; i <= 2; i++) {
        s.insert(grundy(n-i));
    }
    int cur = 0;
    for (int el : s) {
        if (cur >= el) cur = el+1;
    }
    return g[n] = cur;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    grundy(30);
    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();
    int x = 0;
    for (int i = 0; i < m; i++) {
        x ^= g[nums[i]];
    }
    if (x == 0) cout << "Bob" << endl;
    else cout << "Alice" << endl;
    return 0;
}