#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;
int count_primes_between(int x,int y){  
int j,i,count=0,flag;
for(i=x;i<=y;i++){
    flag=0;
    for(j=2;j<=int(sqrt(i));j++){
        if(i%j==0)
            flag=1;
        
    }   
    if(flag==0)
        count++;
}
return count;
}


int main(){
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        int count=count_primes_between(0,n);
        //cout<<count;
        if(count%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;}
    return 0;
}