#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>

using namespace std;

vector<pair<long long, long long> > prime_factorization(long long N){
	vector< pair<long long, long long> > ret;
	
	for(long long i=2; i*i<=N; i++){
		long long tmp = 0;
		while(N%i==0){
			tmp++;
			N/=i;
		}
		if(tmp>0){
			ret.push_back( make_pair(i, tmp) );
		}
	}
	if(N!=1){
		ret.push_back( make_pair(N, 1) );
	}
	return ret;
}

int grundy(vector<int> &memo, int x){
	if(memo[x] >= 0) return memo[x];

	set<int> s;
	auto p = prime_factorization(x);
	for(int i=0; i<p.size(); i++){
		
		s.insert( grundy(memo, x/p[i].first) );
		if(p[i].second >= 2)	s.insert( grundy(memo, x/(p[i].first*p[i].first)) );
	}
	int res = 0;
	while( s.count(res) ) res++;
	memo[x] = res;
	return res;
}

int main(){
	int n;
	cin >> n;
	vector<int> m(n);
	for(int i=0; i<n; i++) cin >> m[i];
	int ans = 0;
	vector<int> memo( *max_element(m.begin(), m.end()) + 1, -1);

	memo[1] = 0;
	
	for(int i=0; i<n; i++){
		ans ^= grundy(memo, m[i]);
	}
	/*
	for(int i=1; i<=*max_element(m.begin(), m.end()); i++){
		cerr << i << " " << memo[i] << endl;
	}
	cerr << endl;
	*/
	cout << (ans==0?"Bob":"Alice") << endl;
	return 0;
}