import std.stdio;
import std.conv;
import std.string;
import std.algorithm;
import std.math;
import std.range;

void main()
{
	uint[100001] a;
	uint primeCount;
	foreach (i; 2 .. 100001)
	{
		primeCount = (isPrime(i)) ? primeCount + 1 : primeCount;
		a[i] = primeCount;
	}
	//writeln(a[0 .. 8]);
	foreach (i; 0 .. stdin.readln.strip.to!int)
	{
		auto n = stdin.readln.strip.to!int;
		if (a[n] == 0 || a[n] % 2 == 0)
			writeln("Bob");
		else
			writeln("Alice");
	}

}

auto isPrime(real n)
{
	if (n == 2)
		return true;
	foreach (i; 2 .. sqrt(n) + 1)
	{
		if (n % i == 0)
			return false;
	}
	return true;
}