#include <bits/stdc++.h> 
using namespace std;
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x.size()))
#define FOI(i,a,n) for(int (i)=int(a);(i)<=int(n);++(i))
#define FOD(i,a,n) for(int (i)=int(a);(i)>=int(n);--(i))
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define MSET(tabl,i) memset(tabl, i, sizeof(tabl))
#define PSET(x,y) fixed<<setprecision(y)<<x

typedef long long ll;
typedef long double lf;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<int> vi;

int toint(const string &s) { stringstream ss; ss << s; int x; ss >> x; return x; }
string tostring ( int number ){  stringstream ss; ss<< number; return ss.str();}

const int INF = 1e9;
const int NMAX=100004;
const ll MOD = 1000000007;

int T,N,M;	
int a,b;

int v[NMAX];
int sum[NMAX];

void Sieve(){
	v[1] = 1;
	for (int i = 4; i < NMAX; i += 2)	{
		v[i] = 1;
	}
	for (int i = 3; i < NMAX; i += 2)
		if (!v[i]){
			for (int j = 2; (j*i) < NMAX; j++)
				if(!v[j*i])
					v[j*i] = 1;
		}

	FOI(i,1,NMAX)
		sum[i] += (1-v[i]) + sum[i-1];
}

int main(){
	ios_base::sync_with_stdio(0);
	Sieve();
	cin>>N;
	FOI(i,1,N){
		cin>>a;
		if(sum[a]%2)
			cout<<"Alice\n";
		else
			cout<<"Bob\n";
	}
	return 0;
}