#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>
using namespace std;
map<int,int> p;
map<int,int> primes;

int prime(int p){
	for(int i=2;i<=sqrt(p);i++){
		if(p%i==0){
			return 0;
		}
	}
	return 1;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    for(int i=2;i<320;i++){
    	if(prime(i)){
    		p[i]=1;
		}
	}
	map<int,int>::iterator it;
	int flag=0;
	for(int i=2;i<=100000;i++){
		if(p.find(i)!=p.end()){
			primes[i]=1;
		}
		else{
			it=p.begin();
			while(it->first<=sqrt(i)&&it!=p.end()){
				if(i%it->first==0){
					flag=1;
					break;
				}
				it++;
			}
			if(flag==0){
				primes[i]=1;
			}
			flag=0;
		}
	}
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		int ctr=0;
		it=primes.begin();
		while(it->first<=n && it!=primes.end()){
			ctr++;
			it++;
		}
		if(ctr%2==1){
			cout<<"Alice"<<endl;
		}
		else{
			cout<<"Bob"<<endl;
		}
	}
    return 0;
}