#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int g;
    cin >> g;
    unordered_map<int,int> mymap;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        int c=0,a=1,max=0;
        for(auto it=mymap.begin();it!=mymap.end();it++)
            {
            if(it->first<=n&&it->first>max)
                {
                c=it->second;
                a=it->first;
                max=it->first;
            }
        }
        for (a=a+1; a <=n; a++) {
        bool prime = true;

        for (int c = 2; c*c <= a; c++) {
             if(a % c == 0) {
                 prime = false;
                 break;
             }
         }

         if(prime) c++;
    }
        mymap.insert(make_pair(n,c));
        if(c%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
       
    }
    return 0;
}