#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

#define FOR(k,a,b) for(int k(a); k < (b); ++k)
#define REP(k,a) for(int k=0; k < (a); ++k)
#define ABS(a) ((a)>0?(a):-(a))

int main(int argc, char** argv) {
#ifdef HOME
	freopen("in.txt", "rb", stdin);
	freopen("out.txt", "wb", stdout);
#endif
	vector<int> v(100002,1);
	v[0]=v[1]=0;
	FOR(i,2,100002)
	{
		for(int j= 2*i;j<100002;j+=i)
		{
			v[j]=0;
		}
	}
	FOR(i,1,100002)
	{
		v[i] = v[i-1]+v[i];
	}
	int T,tmp;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&tmp);
		if(v[tmp]&1)
		{
			printf("Alice\n");
		}
		else
		{
			printf("Bob\n");
		}
	}
	return 0;
}