//The best is yet to come...
 #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define S second
#define F first
#define boost1 ios::sync_with_stdio(false);
#define boost2 cin.tie(0);
#define mem(a,val) memset(a,val,sizeof a)
#define endl "\n"
#define maxn 1000001

ll prime[maxn];
void seive()
{
	ll i,j;
	prime[0]=prime[1]=1;
	for(i=2;i<=100000;i++)
	{
		if(prime[i])
		continue;
		for(j=2*i;j<=100000;j+=i)
		prime[j]=1;
	}
	for(i=0;i<=100000;i++)
	prime[i]=1-prime[i];
	for(i=1;i<=100000;i++)
	prime[i]+=prime[i-1];
}
int main()
{
	boost1;boost2;	
	ll i,j,n,q;
	seive();
	cin>>q;
	while(q--)
	{
		cin>>n;
		if(prime[n]%2)
		cout<<"Alice"<<endl;
		else
		cout<<"Bob"<<endl;
	}
	return 0;
}