#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 primes[100005];

void seive()
{
    for(int i=0;i<100005;i++)
        primes[i]=1;
    primes[0]=primes[1]=0;
    for(int i=0;i*i<=100005;i++) {
        if(primes[i]==1)
            for(int j=i*i;j<100005;j=j+i)
                primes[j]=0;
    }
    for(int i=2;i<100005;i++)
        primes[i]=primes[i-1]+primes[i];
    
}

int main(){
    seive();
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if(primes[n]%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}