#pragma comment(linker, "/STACK:64777216")
#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <map>
#include <list>
#include <iterator>
#include <set>
#include <queue>
#include <iostream>
#include <sstream>
#include <stack>
#include <deque>
#include <cmath>
#include <memory.h>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <utility>
#include <cassert>
#include <complex>
#include <time.h>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back

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

const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;

const int MAX = 100100;
int P[MAX];
int S[MAX];

int main()
{
	//freopen("out47.txt", "r", stdin);
	//ios::sync_with_stdio(false); cin.tie(false);	


	for (int i = 2; i * i < MAX; i++)
	{
		if (P[i]) continue;
		for (int j = i * i; j < MAX; j += i)
		{
			P[j] = 1;
		}
	}

	P[0] = P[1] = 1;

	FOR(i, 1, MAX)
	{
		S[i] = S[i - 1];
		if (P[i] == 0) S[i]++;
	}

	int n;
	cin >> n;
	FOR(i, 0, n)
	{
		int x;
		cin >> x;
		if (S[x] % 2 == 0) printf("Bob\n");
		else printf("Alice\n");
	}


	
	return 0;
}