#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <limits>
#include <string>
#include <map>
#include <fstream>
#include <sstream>

using namespace std;

typedef vector<int> vi;
typedef vector<long long> vll;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<double> vd;
typedef pair<ll, ll> pll;
typedef map<ll, ll> mll;
#define pb push_back
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP2(i,j,n) for(ll i=(ll)(j); i<(ll)(n);i++)
#define SHOW(a) cout << #a << ":" << a <<endl

// print all members in vector
template <typename T>
void vector_print(vector<T>& arr){
	REP(i,arr.size()){
		cout << arr[i] <<" ";
	}
	cout << endl;
}


// create prime list by sieve algorithm
void sieve(ll& N, vll& arr){
	arr.clear();
	vb mark(N+1,true);
	mark[0]=false; mark[1]=false;
	ll num = 2;
	while (num*num<=N) {
		if(mark[num]==false){
			num++;
			continue;
		}
		else{
			ll start = num*num;
			while (start<=N) {
				mark[start] =false;
				start+=num;
			}
		}
		num++;
	}
	REP(i,mark.size()){
		if(mark[i]) arr.pb(i);
	}

}



int main() {
	
	int g;
    cin >> g;
	vll prime;
	ll N =1e5;
	sieve(N,prime);
	vll res(N+1,0);
	int idx = 0;
	for(int i =1; i<N+1; i++){
		if(idx>prime.size()-1){
			break;
		}
		if(i<prime[idx]){
			res[i]=res[i-1];
		}
		else{
			res[i]=res[i-1]+1;
			idx++;
		}
	}
	for(int i=10; i<N+1; i++){
		if(res[i]==0){
			res[i]=res[i-1];
		}
	}
    for(int a0 = 0; a0 < g; a0++){	
	    int n;
	    cin >> n;
		if(res[n]%2==0){
			cout << "Bob" <<endl;
		}
		else{
			cout << "Alice" <<endl;
		}
	
	}
	   
	
	return 0;
}