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

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int main(void) {
    int i, j, n;
    int m[100], grundy[100];
    cin >> n;
    rep (i,n) cin >> m[i];
    rep (i,n) {
        map<int,int> mp;
        int x = m[i];
        for (j = 2; j * j <= x; j++) {
            if (x % j == 0) {
                mp[j]++;
                x /= j;
                j--;
            }
        }
        mp[x]++;
        grundy[i] = 0;
        for (auto p : mp)
            grundy[i] ^= p.second % 3;
    }
    int ans = 0;
    rep (i,n) ans ^= grundy[i];
    if (ans == 0)
        cout << "Bob" << endl;
    else
        cout << "Alice" << endl;
    return 0;
}