#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		long int n,count=0;
		cin>>n;	
		bool prime[n+1];
		memset(prime,true,sizeof(prime));
		for(int p=2;p*p<=n;p++)
		{
			if(prime[p]==true)
			{
				for(int i=p*2;i<=n;i+=p)
					prime[i]=false;
			}
		}
		for(int p=2;p<=n;p++)
		{
			if(prime[p])
			count++;
		}
		//cout<<count<<endl;
		if(count%2==1)
		cout<<"Alice"<<endl;
		else
		cout<<"Bob"<<endl;
		
		}
}