#include<bits/stdc++.h>
#define endl '\n'
using namespace std;

void sieveofe(int n,vector<int> &v)
{
	bool check[n];
	//memset(check,false,sizeof(check));
	
    for(int i=0;i<n;i++)
        check[i]=false;
	for(int i=2;i<=100000;i++)
	{
		if(!check[i])
		{
		for(int j=i*2;j<=n;j+=i)
		{
			if(!check[j])
			check[j]=true;
		}
		check[i]=true;
		v.push_back(i);
		}
	}
	
	}
	
int main()
{
	int g;
	cin>>g;
	vector<int> primes;
	sieveofe(100000,primes);
	//cout<<primes.size()<<endl;
	int sz=primes.size();
	while(g--)
	{
		int n;
		cin>>n;
		int count=0;
		for(int i=0;i<sz;i++)
		{
			if(primes[i]<=n)
			count++;
		}
		//cout<<"n is "<<n<<" and count is "<<count<<endl;
		if(count&1)
		cout<<"Alice"<<endl;
		else
		cout<<"Bob"<<endl;
	}
	
	
	return 0;
	}