#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <assert.h>
#include <algorithm>
#include <iomanip>
#include <time.h>
#include <math.h>
#include <bitset>

#pragma comment(linker, "/STACK:256000000")

using namespace std;

typedef long long int int64;
typedef long double double80;

const int INF = (1 << 29) + 5;
const int64 LLINF = (1ll << 59) + 5;
const int MOD = 1000 * 1000 * 1000 + 7;

int n;
int cnt[228228];

bool is_prime(int x)
{
	if (x == 2) return true;
	if (x % 2 == 0) return false;
	for (int i = 3; i * i <= x; ++i)
	{
		if (x % i == 0) return false;
	}
	return true;
}

int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);

	cnt[0] = cnt[1] = 0;
	for (int i = 2; i < 228228; ++i)
	{
		cnt[i] = cnt[i - 1] + is_prime(i);
	}
	int t;
	scanf("%d", &t);
	for (int i = 0; i < t; ++i)
	{
		scanf("%d", &n);
		if (cnt[n] & 1)
		{
			printf("Alice\n");
		}
		else
		{
			printf("Bob\n");
		}
	}

	fclose(stdin);
	fclose(stdout);

	return 0;
}