#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define make0(a) memset(a,0,sizeof(a))
#define make1(a) memset(a,-1,sizeof(a))
#define all(v) v.begin(),v.end()
#define sc(i) scanf("%d",&i)
#define pi pair <int,int>

const int mod = 1e9+7;

int max(int a,int b,int c) { return max(max(a,b),c); }

int min(int a,int b,int c) { return min(min(a,b),c); }

void input(int a[],int n) { for (int i = 0; i < n; ++i) { scanf("%d",&a[i]); } }

int main()
{
	int t;
	cin >> t;

	int numprime[100001];
	bool isprime[100001];
	for (int i = 0; i < 100001; ++i)
	{
		isprime[i] = true;
	}
	for (int i = 2; i < 100001; ++i)
	{
		if(isprime[i] == false)
			continue;
		int j = i*2;
		while(j < 100001)
		{
			isprime[j] = false;
			j += i;
		}
	}
	make0(numprime);
	for (int i = 2; i < 100001; ++i)
	{
		if(isprime[i])
		{
			numprime[i] = numprime[i-1] + 1;
		}
		else
			numprime[i] = numprime[i-1];
	}

	while(t--)
	{
		int n;
		cin >> n;
		if(n == 1)
			cout << "Bob\n";
		else
		{
			if(numprime[n]%2 == 0)
			{
				cout << "Bob\n";
			}
			else
				cout << "Alice\n";
		}
	}	
	return 0;
}