#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

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

int dp[100];

int grundy(int n) {
	if (n <= 0) return 0;
	if (dp[n] >= 0) return dp[n];
	set<int> s;
	s.insert(grundy(n - 1));
	s.insert(grundy(n - 2));

	int res = 0;
	while (s.count(res)) res++;
	return dp[n] = res;
}

int main() {
	int N;
	cin >> N;
	vector<int> v;
	memset(dp, -1, sizeof(dp));
	rep (i, N) {
		int M;
		cin >> M;
		auto pf = primefactor(M);
		for (auto p : pf) {
			v.push_back(p.second);
		}
	}	

	int ans = 0;
	for (int x : v) ans ^= grundy(x);

	if (ans != 0) {
		cout << "Alice" << endl;
	} else {
		cout << "Bob" << endl;
	}

	return 0;
}