#include <bits/stdc++.h>
using namespace std;

int main(){
	int t,n,i,j;
    vector<bool> v(100001,1);
    vector<int> prime,count;
    
    v[0]=0; v[1]=0;
    
    for(i=2;i<=100000;i++){
        if(v[i]==1){
            for(j=2*i;j<=100000;j+=i){
                v[j]=0;
            }
        }
    }
    
    int c=0;
    for(i=0;i<=100000;i++){
        if(v[i]==1){
            c++;
            prime.push_back(i);
            count.push_back(c);
        }
    }
    
	cin >> t;
	while(t--){
		cin >> n;
		
        int ind;
        ind = lower_bound(prime.begin(),prime.end(),n) - prime.begin();
        
        //cout << ind << " ";
		if(prime[ind]==n){
            if(count[ind]%2==0) cout << "Bob\n";
            else cout << "Alice\n";
        }
        else{
            if(count[ind-1]%2==0) cout << "Bob\n";
            else cout << "Alice\n";
        }
        
	}
}