#include<bits/stdc++.h>
using namespace std;

bool prime[100001];
int cnt[100001];

void sieve()
{
	int i,j;
	
	memset(prime,true,sizeof(prime));
	prime[0]=prime[1]=false;
	
	i=2,j=2;
	while(i*j<=100001)
	{
		prime[i*j]=false;
		j++;
	}
	
	i=3,j=2;
	while(i*j<=100001)
	{
		prime[i*j]=false;
		j++;
	}
	
	for(i=5;i*i<=100001;i+=6)
	{
		if(prime[i])
		{
			 j=2;
			 while(i*j<=100001)
			 {
			 	prime[i*j]=false;
			 	j++;
			 }
		}
		if(prime[i+2])
		{
			j=2;
			while((i+2)*j<=100001)
			{
				prime[(i+2)*j]=false;
				j++;
			}
		}
	}
}

int main()
{
	sieve();
	
	int i,j,k;
	
	cnt[1]=0;
	for(i=2;i<=100000;i++)
	{
		if(prime[i])
		cnt[i]=cnt[i-1]+1;
		else
		cnt[i]=cnt[i-1];
	}
	
	int t;
	cin>>t;
	while(t--)
	{
		 int n;
		 cin>>n;
		 
		 if(cnt[n]%2==0)
		 {
		 	  cout<<"Bob\n";
		 }
		 else
		 {
		 	cout<<"Alice\n";
		 }
	}
}