#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 100009
bool p_cal[N]={0};
vector<int>  primes;

void cultivate_p(){
    for(long long i=2; i<N; i++){
        if(p_cal[i] == false){
            primes.push_back(i);
            for(long long j=i*i; j<N; j+=i){
                p_cal[j]=true;
            }
        }
    }
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    cultivate_p();
    int g,n;
    cin>>g;
    while(g--){
        cin>>n;
        int i;
        for(i=0; i<primes.size() && primes[i]<=n; i++){
            
        }
        if(i%2 == 0){
            cout<<"Bob"<<endl;
        }else{
            cout<<"Alice"<<endl;
        }
    }
    return 0;
}