/*     Abhinav Vaishya (abhinav_2812)          */
/*     DA-IICT                    */


#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iomanip>

typedef long long LL;

#define REP(i,s,n)  for (int i=(s),_n=(n);i<=_n;i++)
#define FOR(i,n)  for (int i=0,_n=(n);i<_n;i++)
#define REPD(i,e,s)  for (int i=(e),_s=(s);i>=_s;i--)
#define tr(container, it) \
	for (typeof(container.begin()) it=container.begin(); it!=container.end();it++)
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(),x.end()

using namespace std;
bool isComposite[1000001];
int main(){
	int n;
	cin>>n;
	memset(isComposite,false,sizeof isComposite);
	vector<int> primes;
	int i;
	for(i=2; i*i<=1000000; i++) {
		if(!isComposite[i]) {
			primes.push_back(i);
			for(int j=i*i; j<=1000000; j+=i) isComposite[j]=true;
		}
	}
	for( ; i<=1000000; i++) {
		if(!isComposite[i]) primes.push_back(i);
	}

	for(int i=0; i<n; i++) {
		int x;
		cin>>x;
		if(x==1) cout<<"Bob"<<endl;
		else if(x==primes[0] ) cout<<"Alice"<<endl;
		else if(x==primes[1]) cout<<"Bob"<<endl;
		else if(x==4) cout<<"Bob"<<endl;
		else if(x>4){
			for(int i=2; i<=primes.size() ; i++) {

				if(i%2==0) {
					if(x==primes[i]){
						{cout<<"Alice"<<endl;
							break;}
					}
					else if(x>primes[i] && x<primes[i+1]) {cout<<"Alice"<<endl;
						break;}
				}
				else if(i%2!=0) {
					if(x==primes[i]) {
						cout<<"Bob"<<endl;
						break;
					}
					else if(x>primes[i] && x<primes[i+1]) {cout<<"Bob"<<endl; break;}
				}
			}
		}
	}
return 0;
}