#include <cstdio>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <set>
using namespace std;

map< vector<int> , int> dp;
vector<int> factor(int n){
	vector<int> ret;
 
	int i = 2;
	while(i*i<=n){
		if(n%i==0)ret.push_back(i) , n/=i , i = 2;
		else i++;
	}
	if(n!=1)ret.push_back(n);
	
	return ret;
}

int dfs(vector<int> x){
	if( x.size() == 0 ) return 0;
	if( dp.count(x) ) return dp[x];
	set<int> g;
	
	for(int i = 0 ; i < x.size() ; i++){
		vector<int> y = x;
		y.erase(y.begin()+i);
		g.insert(dfs(y));
	}
	int ans = 0;
	while(g.count(ans))ans++;
	return dp[x] = ans;
}
int main(){
	int n;
	cin >> n;
	int x = 0;
	int cnt = 0;
	for(int i = 0 ; i < n ; i++){
		int a; cin >> a;
		int s = dfs(factor(a));
		x ^= s;
		if( s == 1 ) cnt++;
	}
	int r = 0;
	if( cnt == 0 && x == 0 ) r = 1;
	else if( cnt == 1 ) r = 1;
	else if( cnt > 1 && x != 0 ) r = 1;
	else r = 0;

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