#include <bits/stdc++.h>
using namespace std;
int Sieve(int n)
{
    bool prime[n+1];
    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 k=0;
    for (int p=2; p<=n; p++)
       if (prime[p])
          k++;
    return k;
}

int main()
{
    int t,n,k;
    cin>>t;
    while(t--)
	{
		cin>>n;
		k=Sieve(n);
		//cout<<k;
		if(k%2!=0)
		{
			cout<<"Alice\n";
		}
		else
			cout<<"Bob\n";
	}
    
    return 0;
}