#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;
vector<long> primes;
bool seive[100001]={0};

long long unsigned max_range;
void make_seive(long n){    
    if(n<max_range)
        return;
    while(max_range<=n){
        //cout<<max_range<<" ";
        for(long i=2*max_range;i<=100000;i+=max_range)seive[i]=true;
        max_range+=2;
        while(seive[max_range]==true)max_range+=2;
        
        primes.push_back(max_range);
    }
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    primes.push_back(2);
    primes.push_back(3);
    seive[3]=false;
    max_range=3;
    long t,n;
    cin>>t;
    while(t--){
        cin>>n;
        if(n==1)
            cout<<"Bob"<<endl;
        else{
            make_seive(n);
            long long count=0;
            while(primes[count]<=n)count++;
            //cout<<primes.size()<<"|"<<count<<endl;
            if(count%2)cout<<"Alice"<<endl;
            else cout<<"Bob"<<endl;
        }
    }
    return 0;
}