#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int > pii;

#define sc(x) scanf("%d",&x);
#define sc2(x,y) scanf("%d%d",&x,&y);
#define sc3(x,y,z) scanf("%d%d%d",&x,&y,&z);

#define scl(x) scanf("%lld",&x);
#define scl2(x,y) scanf("%lld%lld",&x,&y);
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);

#define pb push_back
#define mp make_pair

#define M 1000000007
#define inf 99999999999999999ll	//long long inf
#define PI 3.1415926535897932384626

#define debug(x) cerr<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";
#define debug4(x,y,z,a) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\t"<<#a<<" :: "<<a<<"\n";

#define LIM 100020
int cumu[100202]={0};

int func(int n){
	return cumu[n];
}
int main()
{
	ll i,j,t;
	int a[100024];
	a[1]=1;
	for(i=2;i<=LIM;i++)
	{
		if(a[i]==0)
		for(j=i*i;j<=LIM;j+=i)
		{
			a[j]=1;
		}
	}
	for(i=1;i<=100000;i++)
	{
		if(a[i]==0)
		{
			cumu[i]=cumu[i-1]+1;
		}
		else
		{
			cumu[i]=cumu[i-1];
		}
	}
	int g;
	sc(g);
	while(g--)
	{
		int n;
		sc(n);
		int ans=func(n);
		if(ans%2==0)
		{
			printf("Bob\n");
		}
		else
		{
			printf("Alice\n");
		}
	}
	return 0;
}