#include <bits/stdc++.h>
#define lli long long int


using namespace std;
bool prime[100010];
void SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    
}
int main()
{
    lli t;
    cin>>t;
    SieveOfEratosthenes(100005);
    while(t--)
    {
        lli n,ans=0,i;
        cin>>n;
        for(i=2;i<=n;i++)
        {
            if(prime[i]==true)
            {
                ans++;
            }
        }
        if(ans%2==0)
        {
            cout<<"Bob"<<endl;
        }
        else
        {
            cout<<"Alice"<<endl;
        }
    }
    //cout << "Hello world!" << endl;
    return 0;
}