#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

vector<bool> prime(100010,true);
void intialize(){
    
    prime[0]=false;
    prime[1]=false;
    for(int i=2;i<=sqrt(100010);i++){
        
        if(prime[i]){
            for(int j=i*i;j<100010;j=j+i){
                if(prime[j])
                 prime[j]=false;
            }
            
        }
    }
}
int main(){
    intialize();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        int count=0;
        for(int i=1;i<=n;i++){
            if(prime[i]) count++;
        }
        if(count==0 || !(count&1) ) cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
    return 0;
}