#include <iostream>
#include <algorithm>
#include <vector>
#include <limits.h>
#include <math.h>

using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define ran(i, m, n) for ((i) = (m); (i) < (n); (i)++)

static bool p[100001];
static int pn[100001];

int main(int argc, char *argv[])
{
	int n, g;
	int i;

	fill(p, p+100001, true);
	ran (i, 2, 318) if (p[i]) {
		int j = i*i;
		while (j < 100001) {
			p[j] = false;
			j += i;
		}
	}
	pn[1] = 0;
	ran (i, 2, 100001) {
		pn[i] = pn[i-1] + (p[i] ? 1 : 0);
		if (p[i])
		cerr << "prime: " << i << endl;
	}
	cin >> g;
	while (g--) {
		cin >> n;
		if (pn[n]&1)
			cout << "Alice" << endl;
		else
			cout << "Bob" << endl;
	}
	return 0;
}