#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>

using namespace std;

std::vector<int> gen_primes(int n)
{
	std::vector<int> primes;
	bool prime[100000];
	for (int i = 0; i < 100000; ++i)
	{
		prime[i] = true;
	}

	for (int p = 2; p*p <= n; p++)
	{
		if (prime[p] == true)
		{
			for (int i = p * 2; i <= n; i += p)
				prime[i] = false;
		}
	}


	for (int p = 2; p <= n; p++)
		if (prime[p])
			primes.push_back(p);

	return primes;
}


int main() {
	int n;
	std::cin >> n;
	int g;
	std::vector<int> primes;

	for (int i = 0; i < n; ++i)
	{
		std::cin >> g;
		primes = gen_primes(g);
		if (primes.size() % 2 == 0) std::cout << "Bob" << std::endl;
		else std::cout << "Alice" << std::endl;
	}

	return 0;
}