#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 t,c=0;
    int low=1,high,i,flag;
    cin>>t;
    for(i=0;i<t;i++){
        cin>>high;
        while (low < high)
        {
            flag = 0;
            for(i = 2; i <= low/2; ++i)
            {
                if(low % i == 0)
                {
                    flag = 1;
                    break;
                }
            }
            if (flag == 0)
                c++; 
            ++low;
        }
        if(c%2!=0){
            cout<<"Alice"<<endl;
        }
        else{
            cout<<"Bob"<<endl;
        }
    }
    cout<<"Alice";
    return 0;
}