#include <bits/stdc++.h>

#define F first
#define S second
#define mp make_pair
#define pb push_back
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define pii pair < int , int >

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = 1e6 + 123;
const int mod = 1e9 + 7;
const int INF = 1e9 + 1;
const ll INFL = 3e18 + 1;
const double pi = acos(-1.0);

vector < int > p(1e5 + 1, true);
int sum[N];

int main () {
	
	ios_base::sync_with_stdio (0);
	cin.tie (0);
	p[0] = p[1] = 0;
	for (int i = 2;i <= 1e5;i ++) {
		if (p[i] && i * 1ll * i <= 1e5)
			for (int j = i * i;j <= 1e5;j += i) 
				p[j] = 0;
	}
	for (int i = 1;i <= 1e5;i ++) {
		sum[i] = sum[i - 1];
		if (p[i]) sum[i] ++;
	}
	int t;
	cin >> t;
	while (t --) {
		int n;
		cin >> n;
		if (sum[n] % 2 == 0) puts ("Bob");
		else puts ("Alice");
	}

return 0;       
}