#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,coutn=0,low,high,flag,i;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        coutn=0;
        int n;
        cin >> n;
        for (int i=2; i<=n; i++) 
    {
        bool prime=true;
        for (int j=2; j*j<=i; j++)
        {
            if (i % j == 0) 
            {
                prime=false;
                break;    
            }
        }   
        if(prime) coutn++;
    }
        
        //cout<<coutn<<endl;
     if(coutn%2==0)
         cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}