#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;
bool primes[100005];
void pre()
    {
    for(int i=2;i*i<100001;i++)
        {
        if(primes[i]==false)
            continue;
        
        for(int j=i*i;j<100001;j+=i)
            primes[j]=false;
    }
}

int main(){
    int g;
    cin >> g;
    memset(primes,true,sizeof(primes));
    primes[0]=primes[1]=false;
    pre();
    /*for(int i=0;i<17;i++)
        cerr<<primes[i]<<" ";*/
    for(int a = 0; a < g; a++){
        int n;
        cin >> n;
        int cc=count(primes,primes+n+1,true);
        
        (cc&1)? cout<<"Alice\n":cout<<"Bob\n";
            
        // your code goes here
    }
    return 0;
}