#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
bool isPrime[100010];
vector<int> prime; 
void sieve(){
    memset(isPrime,0,sizeof(isPrime));
    for(int i=2;i<=100005;i++){
        if(isPrime[i]==false){
            for(int j=2*i;j<=100005;j+=i){
                isPrime[j]=true;
            }
        }
    }
    for(int i=2;i<=100005;i++){
        if(isPrime[i]==false){
            prime.push_back(i);
        }
    }
    
    
    
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    sieve();
    int n ;
    int c=0;
    cin>>n;
    for(int i=0;i<n;i++){
        int temp;
        cin>>temp;
        auto it = upper_bound(prime.begin(),prime.end(),temp);
        c = it - prime.begin();
        
        if(c&1)cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    
    return 0;
}