#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
int m[10010];

int grundy[10010];

map<int, int> prime_factor(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] = 1;
    return res;
}

int calc_grundy(int k) {
    if (k == 1) return 0;
    if (grundy[k] < 0) {
        set<int> memo;
        map<int, int> pf = prime_factor(k);
        for (auto v : pf) {
            memo.insert(calc_grundy(k/v.first));
            if (v.second > 1) {
                memo.insert(calc_grundy(k/(v.first*v.first)));
            }
        }
        
        int res = 0;
        while (memo.count(res)) res++;
        grundy[k] = res;
    }
    return grundy[k];
}

bool solve() {
    memset(grundy, -1, sizeof(grundy));
    int res = 0;
    for (int i = 0; i < n; i++) res ^= calc_grundy(m[i]);
    return res != 0;
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> m[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << (solve()?"Alice":"Bob") << endl;
}