#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;

long long count=0;
void simpleSieve(long long limit, vector<long long> &prime,long long m,long long n)
{
    bool mark[limit+1];
    memset(mark, true, sizeof(mark));
 
    for (long long p=2; p*p<limit; p++)
    {
        if (mark[p] == true)
        {
            for (long long i=p*2; i<limit; i+=p)
                mark[i] = false;
        }
    }
    for (long long p=2; p<limit; p++)
    {
        if (mark[p] == true)
        {
            prime.push_back(p);
            if(m<=p && p<=n)
                count++;
        }
    }
  //  cout<<"simple:"<<count<<endl;
}
void segmentedSieve(long long m,long long n)
{
    long long limit =floor(sqrt(n))+1;
    vector<long long> prime;  
    simpleSieve(limit, prime,m,n); 
    long long low=m;
    long long high=m+limit;
    while(low<n)
    {
        if(high>=n)
            high=n+1;
        bool mark[limit+1];
        memset(mark, true, sizeof(mark));
        for(long long i=0;i<prime.size();i++)
        {
            long long start=((long long)(low/prime[i]))*prime[i];
            if(start<low)
                start+=prime[i];
            //cout<<"test "<<start<<endl;
            for(long long j=start;j<high;j+=prime[i])
                mark[j-low]=false;
        }
        if(low==1)
            mark[0]=false;
        for(long long i=low;i<high;i++)
        {
            if(mark[i-low])
                count++;
        }
        low+=limit;
        high+=limit;
    }
   // cout<<"se:"<<count<<endl;
}
int main()
{
	long long t,n;
	cin>>t;
	while(t--)
	{
        count=0;
		cin>>n;
		segmentedSieve(1,n);
        if(count%2==0)
		    cout<<"Bob "<<endl;
        else
            cout<<"Alice "<<endl;
	}
	return 0;
}