#include<bits/stdc++.h>

#define SIZE 100001
#define MAX (int)(SIZE - 3) / 2

using namespace std;

int primes[MAX + 1];                                                   //array that stores the primes up to sqrt(SIZE)
bitset<MAX + 1> bset;                                                  //auxiliary bitset used to make the sieve

void setPrimes()
{
    int i, j;

    for (i = 0; (i * i) <= SIZE; i++)                                          //we only have to get primes up to sqrt(SIZE)
    {
        if (!bset.test(i))
        {
            for (j = i + 1; (2 * j + 1)*(2 * i + 3) <= SIZE; j++)
            {
                bset.set(((2 * j + 1)*(2 * i + 3) - 3) / 2);                   //setting all non-primes
            }
        }
    }

    primes[0] = 2;                                                     //store the first prime (that is 2)

    for (i = 1, j = 0; j < MAX + 1; j++)
    {
        if (!bset.test(j))
        {
            primes[i++] = 2 * j + 3;                                        //store the remaining odd primes
        }
    }
}

int main()
{
    int test;
    scanf("%d",&test);
    setPrimes();
    for(int i=0; i<test; i++)
    {
        long long int n;

        cin>>n;
        long long int co=0;
        for(int i=0; i<n; i++)
        {
            if(primes[i]>n|primes[i]==0) break;
            else co++;
}
        if(co%2==0) cout<<"Bob"<<endl;
        else cout<<"Alice"<<endl;
    }
}