#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 prime[100001]={0},len=0,b[100001]={0};
void seive()
{
    int a[100001]={0};
    for(int i=2;i<=sqrt(100001);i++)
    {
        if(a[i]==0)
            for(int j=i*i;j<=100001;j+=i)
                a[j]=1;
    }
    for(int i=2;i<=100000;i++)
        if(a[i]==0)
            prime[len++]=i;
    b[0]=0;b[1]=0;b[2]=1;
    int sum=1;
    for(int i=0;i<len-1;i++)
    {
        //cout<<prime[i];
        for(int j=prime[i];j<prime[i+1];j++)
            b[j]=sum;
        sum++;
    }
    b[len]=sum;
}

int main(){
    seive();
    int g;
    cin >> g;
    for(int i = 0; i < g; i++){
        int n;
        cin >> n;
        if(b[n]%2==1)
            cout<<"Alice\n";
        else
            cout<<"Bob\n";
        // your code goes here
    }
    return 0;
}