//Daniel Grzegorzewski
#include <bits/stdc++.h>

#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace std;

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios()
{
     ios_base::sync_with_stdio(0);
     cin.tie(0);
}

bool prime(int x) {
	if (x < 2)
		return false;
	for (int i = 2; i*i <= x; ++i)
		if (x%i == 0)
			return false;
	return true;
}

int t, n, ile[(int)1e5+10];

int main()
{
	init_ios();	
	cin >> t;
	for (int i = 2; i <= (int)1e5+2; ++i) {
		ile[i] = ile[i-1];
		if (prime(i))
			++ile[i];
	}
	while (t--) {
		int x;
		cin >> x;
		if (ile[x]%2 == 0) {
			cout<<"Bob\n";
		}
		else {
			cout<<"Alice\n";
		}
	}
}