#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <stack>
using namespace std;
int isPrime(long long int);
int main()
{
    int g,n,i,j=0,k,x,y;
    int prime[9592];
    for(i=2;i<=100000;i++)
    {
        if(isPrime(i)==1)
        {
            prime[j]=i;
            j++;
        }
    }
       cin>>g;
    while(g>0)
    {
        cin>>n;
        int c=0;
        for(i=0;i<9592;i++)
        {
            if(n<prime[i])
            {
                break;
            }
            c++;
        }
        if(c%2==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;


    g--;}
}
int isPrime(long long int n)
{
long long int i;
if(n == 2) return 1;
if(n%2 == 0) return 0;
for(i = 3; i*i<=n; i+=2)
    {
    if(n%i == 0) return 0;
    }
    return 1;
}