#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
vector<long int> pc(2,0);
vector<long int> primes(0);
void find_count_primes(long int t)
{
	long int i,j,s;
	bool flag;
	for(i=2;i<=t;i++)
	{
		flag=true;
		s=sqrt(i);
		for(j=0;j<primes.size();j++)
			if(i%primes[j]==0)
			{
				flag=false;
				break;
			}
		if(flag)
			primes.push_back(i);
		pc.push_back(primes.size());
	}
}
int main()
{
	int t,i;
	cin>>t;
	long int a[t],max=-1;
	for(i=0;i<t;i++)
	{
		cin>>a[i];
		if(max<a[i])
		{
			max=a[i];
		}
	}
	find_count_primes(max);
	for(i=0;i<t;i++)
	{
		if(pc[a[i]]%2==0)
			cout<<"Bob"<<endl;
		else
			cout<<"Alice"<<endl;
	}
	return 0;
}