#include <iostream>
#include <cmath>
#include <map>
#include <limits.h>
#define X first 
#define Y second 
#define MP make_pair
#define PB push_back
#define ll long long
#define CLR(x) memset(x,0,sizeof(x))
#define vrep(i, v)    for(int i = 0; i < v.size(); i++)
#define rep(i, a, b)  for(int i = a; i <= b; i++)
#define drep(i, a, b) for(int i = a; i >= b; i--)
using namespace std;
const double pi = acos(-1.), eps = 1e-6;
const int                   Maxn=200010,Maxm=2500000,Mo=1e9 + 7,oo=INT_MAX >> 1;
const int sp[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
int T;
using namespace std;
ll a[Maxn],b[Maxn];
ll n,m,s;

bool vis[Maxn];
int cnt[Maxn];
map<int,int> sum;
int main()
{
	rep(i,2,100000){
		if (!vis[i]){
			cnt[i] = 1;
			for (int j =i;j<=100000;j+=i)
				vis[j] = 1;
		}
		cnt[i] += cnt[i-1];
	}
	cin >> T;
	while(T--){
		cin >> n;
		if (cnt[n]% 2)puts("Alice");
		else puts("Bob");
	}

    return 0;
}