#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 100;
int gr[N];

int rec(int n){
	if (!n) return 0;
	int &res = gr[n];
	if (res + 1) return res;

	int x[3] = {};
	for (int i = 1; i <= 2; ++i){
		if (n - i >= 0) x[rec(n - i)] = 1;
	}

	for (int i = 0; i < 3; ++i) if (!x[i] && res < 0) res = i;

	return res;
}

int main(){
	memset(gr, -1, sizeof(gr));

	int n;
	cin >> n;

	int x = 0;
	while (n--){
		int m;
		cin >> m;
		for (int i = 2; i <= m; ++i){
			int cnt = 0;
			while (m%i == 0) m /= i, ++cnt;
			x ^= rec(cnt);
		}
	}

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