#include<cstdio>
#include<cmath>
bool B[110000]={0};
//long C[110000];
long Calc(long N)
{
    long R=0;
    for(long i=2;i<=N;i++)
        if(B[i]==0)
            R++;
    return R;
}
/*void calc(long N)
    {
    long R=0;
    for(long i=0;i<=N;i++){
        if(B[i]==0)
            R+=1;
        C[i]=R;
    }}*/
void prime(long N)
    {
    long K=sqrt(N);
    for(long i=3;i<=N;i++)
        if(i%2==0)
            B[i]=1;
    for(long i=3;i<=K;i+=2)
        for(long j=i+1;j<=N;j++)
            if(j%i==0)
                B[j]=1;
    //calc(N);
}
int main()
    {
    B[0]=B[1]=1;
    long N,A[1100],max=0;
    scanf("%ld",&N);
    for(long i=0;i<N;i++)
    {
        scanf("%ld",&A[i]);
        if(A[i]>max)
            max=A[i];
    }
    prime(max);
    for(long i=0;i<N;i++)
    {
        long X=Calc(A[i]);
        if(X%2==0)
            printf("Bob\n");
        else
            printf("Alice\n");
    }
    return 0;
}