#include<bits/stdc++.h>
using namespace std;

int sieve(int n)
{
    int count=0;
    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;
        }
    }
 
    for (int p=2; p<=n; p++)
       if (prime[p])
          count++;
    return(count);
}
 

int main()
{
    int t,g,n;
    cin>>t;
    while(t--)
      {
      	cin>>n;
      	int ans=sieve(n);
      	if(ans%2==0)
      	    printf("Bob");
      	else
      	   printf("Alice");
        cout<<"\n";
	  }
}