#include <stdio.h>

int numPrimes;
double sqroot(double num)
{
     double x=1, y;
     double eps=0.0000001;
     y = num;
     while(y-x > eps || x-y > eps)
     {
	  y = num/x;
	  x = (x+y)/2;
     }
     return x;
}


int isPrime(int number, int nPrimes, int pList[])
{
     int limit, prime=1;
     limit = (int)sqroot(number);
     if(number != 2)
     {
	  for(int i=0; i<nPrimes && pList[i] <= limit; i++)
	  {
	       if(number%pList[i] == 0)
	       {
		    prime = 0;
		    break;
	       }
	  }
     }
     return prime;
}

int main()
{
     int t;
     scanf("%d",&t);
     while ( t-- )
     {
	  numPrimes=0;
	  int primeList[2048];
	  int number, i;
	  scanf("%d",&number);
	  if(number <2)
	  {
	       printf("Bob\n");
	  }
	  else
	  {
	       primeList[numPrimes] = 2;
	       numPrimes++;
	       for(i=3; i<=number; i+=2)
		    if(isPrime(i, numPrimes, primeList) == 1)
		    {
			 primeList[numPrimes] = i;
			 numPrimes++;
		    }

	       if ( numPrimes%2==0 )
		    printf("Bob\n");
	       else
		    printf("Alice\n");
	  }
     }
     return 0;
}