#include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define MX 100009
#define ff first
#define ss second
#define mp make_pair
#define pb(a) push_back(a)
#define pii pair<ll,ll>
using namespace std;

ll A[MX];
bool visit[MX];
vector<ll> prime;
bool isPrime[MX+5];

void seive_N_logN(ll N)
{
    ///calculate prime upto N in NlogN time
    memset(isPrime,true,sizeof isPrime);
    prime.clear();

    isPrime[1]=false;
    isPrime[0]=false;
    for (ll i = 4; i<= N; i=i+2)
        isPrime[i]=false;

    for (ll i = 3; i * i<= N; i=i+2)
    {
        if (isPrime[i])
        {
            for (ll j = i * i; j <= N; j += i)
                isPrime[j] = false;
        }
    }
    for(ll i=1; i<=N; i++)
        if(isPrime[i])
            prime.push_back(i);
}

int main()
{
    ll t,T,n,m,i,j,k,ans,a,b,c,x,y,l,r;
    string ss;
//    while(scanf("%lld %lld %lld",&n,&m,&k)!=EOF)
    while(scanf("%lld",&n)!=EOF)
    {
        ans=0;
        for(i=1; i<=n; i++)
        {
            scanf("%lld",&a);
            seive_N_logN(a);
            ans=prime.size();
//            printf("%lld\n",ans);
            if(ans%2)
                printf("Alice\n");
            else
                printf("Bob\n");
        }


    }
    return 0;
}