/*
 * alice.cpp
 *
 *  Created on: 13-Dec-2016
 *      Author: sudeep
 */

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

int calNumberOfPrimes(int);

int main()
{
	int t, numberOfPrimes;
	cin>>t;

	for(int i=0;i<t;i++)
	{
		int n;
		cin>>n;

		numberOfPrimes = calNumberOfPrimes(n);
//		cout<<numberOfPrimes;
		if(numberOfPrimes%2==0)
		{
			cout<<"Bob"<<endl;
		}
		else
		{
			cout<<"Alice"<<endl;
		}

	}
	return 0;
}

int calNumberOfPrimes(int n)
{
	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;
			}
		}
	}
	//To store number of primes
	int result=0;

	for(int p=2;p<=n;p++)
	{
		if(prime[p])
		{
			result++;
		}
	}
	return result;
}