#include <iostream>

#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

#include <cassert>
#include <cmath>
#include <algorithm>
#include <cstdint>

#include <fstream>

#include <cassert>

using namespace std;

#define MY_PI 3.14159265358979323846264338327950288
using LL = long long;
const int INF = 1e9;

const long double kek = 1.0, kek0 = 0.0;
const float eps = 1e-9;
#define DB(x) cerr << #x << " " << x << endl;


vector < int > primes (int n) {
	vector < int > used(n);
	used[1] = 1;
	used[0] = 1;
	vector < int > ans;
	for (int i = 2; i < n; ++i) {
		if (!used[i]) {
			ans.push_back(i);
			for (int j = i + i; j < n; j += i) {
				used[j] = 1;
			}
		}
	}
	return used;
}

int main()
{
	//gen(100);
	//freopen("input.txt", "r", stdin);
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed;
	cout.precision(10);
	int n = 1e5 + 10, k;
	auto pr = primes(n);
	vector < int > sum(n, 0);
	for (int i = 1; i < n; ++i) {
		sum[i] = sum[i - 1] + (pr[i] == 0);
	}
	int m;
	cin >> m;
	for (int i = 0; i < m; ++i) {
		int a;
		cin >> a;
		if (sum[a] % 2 == 0) {
			cout << "Bob\n";
		} else {
			cout << "Alice\n";
		}
		//cout << sum[a] % 2;
	}
	return 0;
}