#include<iostream>
using namespace std;

bool prime[100007];
int nop[100007];

void sieve()
{
	int n = 100000,i,j;
	for(i = 1;i<=n;i++)
	prime[i] = true;
	prime[1] = false;
	for(i = 4;i<=n;i+=2)
	prime[i] = false;
	for(i = 3;i*i<=n;i+=2)
	{
		if(prime[i])
		{
			for(j = i*i;j<=n;j+=2*i)
			{
				prime[j] = false;
			}
		}
	}
	int count = 0;
	for(i = 1;i<=n;i++)
	{
		if(prime[i])
		count++;
		nop[i] = count;
	}
}

int main()
{
	int g;
	cin>>g;
	sieve();
	while(g--)
	{
		int n;
		cin>>n;
		if(nop[n]%2 == 1)
		{
			cout<<"Alice\n";
		}
		else
		cout<<"Bob\n";
	}
}