#include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf ("%d",&x)
#define pd(x) printf("%d\n",x)
#define sl(x) scanf ("%lld",&x)
#define pl(x) printf("%lld\n",x)
#define ll long long
#define fr(i,n) for(i=0;i<n;i++)
#define fro(i,n) for(i=1;i<=n;i++)
#define vi vector<int>
#define vl vector<long long >
#define vii vector<pair<int,int> >
#define vll vector<pair<long long,long long > >
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define MAX 1000000

int n,a;
bool vis[100005];
int ans[100005];


void sieve(){
	memset(vis,0,sizeof vis);
	ans[1] = 0;

	for(int i=2;i<=100000;i++){
		ans[i] = ans[i-1];
		if(vis[i]){

			continue;
		}
		ans[i]++;
		for(int j=i;j<=100000;j+=i){
			vis[j] = 1;
		}
	}
}

int main() {

	sieve();

	sd(n);

	while(n--){
		sd(a);
		if(ans[a]%2==0)
			cout <<"Bob"<<endl;
		else
			cout << "Alice"<<endl;
	}
	
	return 0;
}