#include<iostream>
using namespace std;
	
long checkprime(long a[],long n,long k)
{
	for(long i=0;i<k;i++)
	if(a[i]>n)
	return i-1;
        
        return 1;
}

int main()
{
	long t,n;
	cin>>t;
	
long arr[100001],k,flag,i,j;
for(i=2;i<100001;i++)
		{
			flag=1;
			for(j=2;j*j<=i;j++)
		{
			if(i%j==0)
			{
			 flag=0;
			 break;	
			}
		}
		if(flag)
		{
			arr[k]=i;
			k++;
		}
	}
	while(t--)
	{
		cin>>n;
		int p=checkprime(arr,n,k);
		if(p%2==0)
		cout<<"Alice";
		else
		cout<<"Bob";
		cout<<endl;
	}
}