// C++ program to print all primes smaller than or equal to
// n using Sieve of Eratosthenes
#include <bits/stdc++.h>
using namespace std;

void SieveOfEratosthenes(long long int n)
{
    long int c=0;
	// Create a boolean array "prime[0..n]" and initialize
	// all entries it as true. A value in prime[i] will
	// finally be false if i is Not a prime, else true.
	bool prime[n+1];
	memset(prime, true, sizeof(prime));

	for (long int p=2; p*p<=n; p++)
	{
		// If prime[p] is not changed, then it is a prime
		if (prime[p] == true)
		{
			// Update all multiples of p
			for (int i=p*2; i<=n; i += p)
				prime[i] = false;
		}
	}

	// Print all prime numbers
	for (long int p=2; p<=n; p++)
	if (prime[p])
	{
	    c++;
	}
    if(c%2==0)
        cout<<"Bob\n";
    else
        cout<<"Alice\n";
}

// Driver Program to test above function
int main()
{
	long long int g,n;
    cin>>g;
    while(g--)
        {
        cin>>n;
	SieveOfEratosthenes(n);
    }
	return 0;
}