#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)




typedef long long ll;
map<ll, int> enumpr(ll n) {
	map<ll, int> V;
	for (ll i = 2; i*i <= n; i++) while (n%i == 0) V[i]++, n /= i;
	if (n>1) V[n]++;
	return V;
}
//-----------------------------------------------------------------
int N;
int M[101];
//-----------------------------------------------------------------
int memo[10101];
int grundy(int x) {
	if (0 <= memo[x]) return memo[x];

	set<int> grundies;

	auto m = enumpr(x);
	for (auto pa : m) {
		int p = pa.first;
		grundies.insert(grundy(x / p));
		if(2 <= pa.second) grundies.insert(grundy(x / p / p));
	}
	
	int ret = 0;
	while (grundies.find(ret) != grundies.end()) ret++;
	return memo[x] = ret;
}
//-----------------------------------------------------------------
int main() {
	cin >> N;
	rep(i, 0, N) cin >> M[i];

	rep(i, 0, 10101) memo[i] = -1;

	int g = 0;
	rep(i, 0, N) g = g ^ grundy(M[i]);
	if (g != 0)
		printf("Alice\n");
	else
		printf("Bob\n");
}