#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

void integerFactorization(int n, vector<int>& base, vector<int>& expo)
{
    base.clear();
    expo.clear();
    int a = 2;
    while(a * a <= n){
        int b = 0;
        while(n % a == 0){
            ++ b;
            n /= a;
        }
        if(b > 0){
            base.push_back(a);
            expo.push_back(b);
        }
        ++ a;
    }
    if(n > 1){
        base.push_back(n);
        expo.push_back(1);
    }
}

int main()
{
    vector<int> grundy(15, 0);
    for(int i=1; i<15; ++i){
        set<int> s;
        for(int j=1; j<=2; ++j)
            s.insert(grundy[max(0, i-j)]);

        int k = 0;
        for(auto it=s.begin(); it!=s.end(); ++it){
            if(k != *it)
                break;
            ++ k;
        }
        grundy[i] = k;
    }

    int n;
    cin >> n;
    int ret = 0;
    for(int i=0; i<n; ++i){
        int m;
        cin >> m;
        vector<int> base, expo;
        integerFactorization(m, base, expo);
        for(unsigned i=0; i<expo.size(); ++i)
            ret ^= grundy[expo[i]];
    }

    if(ret == 0)
        cout << "Bob" << endl;
    else
        cout << "Alice" << endl;

    return 0;
}