#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
using namespace std;
#define lli long long int
#define MOD 1000000007

//svp
lli prime[100005] = {1};

void sieve()
{

    for (int p=2; p*p<=100005; p++)
    {	// If prime[p] is not changed, then it is a prime
        if (prime[p] == 1)
        {
            // Update all multiples of p
            for (int i=p*2; i<=100005; i += p)
                prime[i] = 0;
        }
    }
}

int main()
{
	for(lli i=0;i<100005;i++)
		prime[i] =1;
	sieve();
	lli t;
	cin>>t;
	while(t--)
	{
		lli n;
		cin>>n;
		lli count = 0;
		if(n == 1)
			cout<<"Bob"<<endl;
		else
		{
			for(lli i=2;i<=n;i++)
			{
				if(prime[i])
					count++;
			}
			if(count%2 == 0)
		cout<<"Bob"<<endl;
	else
		cout<<"Alice"<<endl;
		}


	}
	


	return 0;
}