#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<sstream>
#include<algorithm>
#include<set>
#include<queue>
#include<map>
using namespace std;
bool prime[100001];
int f[100001];
int dp[100001];

int main(){
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	memset(prime,1,sizeof(prime));
	prime[1]=0;
	prime[0]=0;
	for(int i=2;i*i<=100000;i++)
		for(int j=i*i;j<=100000;j+=i)
			prime[j]=0;
	
	int cont=0;
	f[0]=f[1]=0;
	for(int i=2;i<=100000;i++)
		if(prime[i]){
			f[i]=f[i-1]+1;
		}else{
			f[i]=f[i-1];
		}
	
	int tc;	
	cin>>tc;
	int n;
	while(tc--){
		cin>>n;
		if(f[n]%2==0)
			cout<<"Bob"<<endl;
		else
			cout<<"Alice"<<endl;
	}
	
    return 0;
}