#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int IsPrime(int );
int main()
{
    int n,i,j,k,c=0;
    cin >> k;
   for(j=0;j<k;j++)
   {
   c=0;
   cin >> n;
   for(i=2;i<=n;i++)
	{
	if (IsPrime(i)==1)
	 {
        c++;
     }
     }
       
    if(c%2==0)
        {
        cout << "Bob" <<endl;
        }
    else
        {
        cout << "Alice" <<endl;
        }
    }
	return 0;
}

int IsPrime(int number)
{	
	int j;
	
	for (j=2; j<=number/2; j++)
	{
		if (number % j == 0)
		{
			return 0;
		}
	}
	
	return 1;	
}