#include<bits/stdc++.h>
using namespace std;
bool prime[100000];
int sieve(int n)
{int c=0;
    memset(prime, true, sizeof(prime));
    for (int p=2; p<=n; p++)
    {
    	
        if (prime[p] == true)
        {c++;
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    return c;
}
int main()
{
	int g;
	cin>>g;
	while(g--)
	{
	int n;
	cin>>n;
	//int c=0;
	int c=sieve(n);//cout<<c<<endl;
	if(c%2==0)
	{
		cout<<"Bob"<<endl;
	}
	else
	{
		cout<<"Alice"<<endl;
	}
	}
	return 0;
}