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

typedef long int li;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define getc getchar
#define mid (l+ r>> 1)
#define ff first
#define ss second
#define ins insert
const li mod= 1e9+ 7;

li n;

li cntPrime[ 100005];

bool visited[ 100005];

void pre()
{
	for( li i= 2; i<= 100000; i++)
	{
		cntPrime[ i]= cntPrime[ i- 1];

		if( visited[ i]) continue;

		cntPrime[ i]++;

		for( li j= i; j<= 100000; j+= i) visited[ j]= true;
	}

	return;
}

void solve()
{
	scanf( "%ld", &n);

	if( cntPrime[ n]& 1) printf( "Alice\n");
	else printf( "Bob\n");

	return;
}

int main()
{
	pre();

	li T= 1;

	scanf( "%ld", &T);

	while( T--)
	{
		solve();
	}

	return 0;
}