#include <algorithm>
#include <bitset>
#include <cassert>
#include <deque>
#include <queue>
#include <iomanip>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <float.h>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <math.h>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vp;
typedef vector<string> vs;
typedef set<int> si;
typedef map<int, int> mi;
typedef multimap<int, int> mmi;

const int MAX = 100000;

bool sieve[MAX + 1];
vi primes;

void find_primes()
{
	primes.push_back(2);
	for (int i = 3; i < MAX; i += 2)
	{
		if (!sieve[i])
		{
			primes.push_back(i);
			for (int j = 2; i * j <= MAX; ++j)
			{
				sieve[i * j] = true;
			}
		}

	}
}

void solve()
{
	int n;
	cin >> n;

	vi::iterator it = upper_bound(primes.begin(), primes.end(), n);
	int dist = it - primes.begin();
	cout << ((dist & 1) ? "Alice" : "Bob") << endl;
}

int main(int argc, char* argv[])
{
	ios::sync_with_stdio(false);

	find_primes();

	int g;
	cin >> g;

	for (int i = 0; i < g; ++i)
		solve();

	return 0;
}