#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
#define lli long long int
#define mapit map<lli,lli>::iterator
map<lli,lli> ma;
lli res[100006];
void prime(){
    lli bor=100006;
     vector<lli> primes;
   for (int i = 2; i <= 100002; i++) {
        bool ok = true;
        for (int j = 2; j*j <= i; j++) {
            if (i % j == 0) {
                ok = false;
                break;
            }
        }
        if (ok && i > 1) {
            primes.push_back(i);
        }
    }
    vector<lli>::iterator j=primes.begin(); 
    lli count=0,i;
    for(i=0;j!=primes.end();i++){
        if(*j == i){
            j++;
            count++;
        }
        res[i]=count;
    }
    while(i!=100006){
        res[i]=count;
        i++;
    }
}
int main() {
    lli t;
    prime();
    cin>>t;
    while(t--){
        lli a;
        cin>>a;
        if(res[a]%2 == 0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}