#include <bits/stdc++.h>
using namespace std;
long long int prime[90000];
bool flg[1000000];
int p;

int nmbr_of_primes(long long int n)  // PRIME NMBRS TILL N
{
    long long int i,j; prime[0]=2;p=1;
    flg[0]=flg[1]=1;
    for(i=3;i<=n;i+=2) {
        if(!flg[i]) {
            prime[p++] = i;
            for(j=i*i;j<=n;j+=(2*i)) flg[j]=1;
        }
    }

    return p;

}

int main()
{
    long long int i,k=100000;//cout<<k;
    int x=nmbr_of_primes(k);
    long long int ara[100005];
    long long int cnt=0,p=0;
    for(i=1;i<=100000;i++) {
        if(prime[p]<=i) {cnt++;ara[i]=cnt;p++;}
        else ara[i]=cnt;
    }


    long long int n;
    cin>>n;
    while(n--) {
        long long int a;
        cin>>a;

        if(ara[a]%2) cout<<"Alice\n";
        else cout<<"Bob\n";
    }



}