#include<bits/stdc++.h>
using namespace std;
bool prime[100001];
void SieveOfEratosthenes(int n)
{
    memset(prime, true, sizeof(prime));
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int A[100005];
	 	A[1]=0;
		SieveOfEratosthenes(100001);
		for(int j=2;j<100001;j++)
		{
			if(prime[j]==true)
			A[j]=A[j-1]+1;
			else
			A[j]=A[j-1];
		}
		int n;
		cin>>n;
		int k=A[n];
		if(k%2==0)
		cout<<"Bob"<<endl;
		else
		cout<<"Alice"<<endl;
	}
}