#include <bits/stdc++.h>

using namespace std;

int arr[100005];
int primes[100005];
void seive(){
    memset(arr,0,sizeof(arr));
    int sq=(100002);
    for(int i=2;i<sq;i++){
        if (arr[i]==1)
            continue;
        for(int j=i+i;j<100005;j+=i){
            arr[j]=1;
        }
    }
    memset(primes,0,sizeof(primes));
    int sum=0;
    for(int i=2;i<100002;i++){
        if (arr[i]==0){
            sum++;
        }
        primes[i]=sum;
    }


}


int main(){
    seive();
    int g;
    cin>>g;
    int n;
    for(int tc=0;tc<g;tc++){
        cin>>n;

        if (primes[n]%2==1){
            cout<<"Alice"<<endl;
        }
        else {
            cout<<"Bob"<<endl;
        }


    }
}