#include<bits/stdc++.h>
using namespace std;
int coun=0;
int prime[320000];
int primes[320000];
void sieve(int n)
{
    coun=0;
	prime[0]=0;
	prime[1]=0;
	for (int i = 2; i <320000; ++i)
	{
		prime[i]=1; 
	}
	for (int i = 2; i <sqrt(320000); ++i)
	{
		if(prime[i])
		{
 
			for (int j = 2; j*i<320000; ++j)
			{
 
				prime[i*j]=0;
 
			}
		}
 
	}
	for (int i = 2; i <=n; ++i)
	{
 
		if(prime[i])
		{
            coun++;
		}
	}
}
int main()
    {

int g;
cin>>g;
while(g--)
    {
    int n;
    cin>>n;
    sieve(n);
    // cout<<coun<<endl;
    if(coun%2!=0)
        {
      
        cout<<"Alice"<<endl;
    }
    else
        {
        cout<<"Bob"<<endl;
    }
}
    return 0;
}