#include<bits/stdc++.h>
using namespace std;
#include<unordered_map>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define vi vector<int>
#define pii pair<int,int>
#define foreach(i,t) for(typeof(t.begin()) i =t.begin();i!=t.end();i++)
#define pii pair<int,int>
#define pdn(n) printf("%d\n",n)
#define sl(n) scanf("%lld",&n)
#define sd(n) scanf("%d",&n)
#define pn printf("\n")
#define  omap unordered_map

#define mod 1000000007
typedef long long ll;
typedef long double lf;
int sieve[100050];
int number[100050];
int main()
{
	sieve[2]=0;
	for(int i=2;i<=100040;i++)
	{
		if(sieve[i]==1) // not prime
			continue;
		int j=2*i;
		while(j<=100040)
		{
			sieve[j]=1;
			j+=i;
		}
	}

	for(int i=2;i<=100040;i++)
	{
		number[i]=number[i-1];
		if(sieve[i]==0)
			number[i]++;
	}
	int t;
	cin>>t;
	while(t--)
	{
		int g;
		cin>>g;
		int no=number[g];
		if(no%2!=0)
		{
			cout<<"Alice"<<endl;
		}
		else
		{
			cout<<"Bob"<<endl;
		}
	}
	
}