#include<iostream>
using namespace std;

bool seive(int n)
{
	bool prime[n+1];
	int count = 0;
	for(int i=0;i<=n;i++)
	prime[i]=true;
	
	prime[0]=false;
	prime[1]=false;
	
	for(int i=4;i<=n;i+=2)
	prime[i]=false;
	
	for(int i=3;i*i<=n;i+=2)
	{
		if(prime[i]==true)
		{
			for(int j=i*i;j<=n;j+=2*i)
			prime[j]=false;
		}
	}
	
	for(int i=0;i<=n;i++)
	if(prime[i]==true)
	count++;
	
	if(count%2 == 0)
	return true;
	else
	return false;
}

int main()
{
	int g;
	cin>>g;
	
	while(g--)
	{
		int n;
		cin>>n;
		
		bool result = seive(n);
		
		if(result==true)
		cout<<"Bob"<<endl;
		else
		cout<<"Alice"<<endl;
	}
	
	return 0;
}