#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 main(int argc, char** argv) 
{
	int g;
    cin>>g;
	for (int k = 0; k < g; ++k)
	{
		int n;
		cin>>n;
		bool sieve[n+1];

		for (int i = 0; i <=n; ++i)
		{
			sieve[i]=false;
		}

		int count=0;
		int c=1;
		while(true)
		{
			bool choosen=false;
			for(int i=c+1;i<=n;i++)
			{
				if(sieve[i]==false)
				{	
					c=i;
					choosen=true;
					count++;
                    //cout<<"Taking:"<<c<<endl;
                    break;
				}	
			}
			if(choosen==false)
			{
				break;
			}	
			for (int i = 1; c*i <=n; ++i)
			{
               // cout<<"Making "<<c*i<<" true"<<endl;
				sieve[c*i]=true;
			}
		}
		if(count%2==0)
			cout<<"Bob"<<endl;
		else
			cout<<"Alice"<<endl;
	}
	return 0;
}