#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<utility>
#include<cmath>
using namespace std;

#define csl ios_base::sync_with_stdio(false);cin.tie(NULL);

const int N = 100005;

bool isPrime[N] = {0};

void sieve() 
{   
    for(int i = 1;i<=N;i++)
        isPrime[i] = true; 
    isPrime[0] = false;
    isPrime[1] = false;
    for(int i = 2; i * i <= N; ++i) 
    {
         if(isPrime[i] == true) 
         {
            for(int j = i * i; j <= N ;j += i)
                isPrime[j] = false;
        }
    }
}

int main() 
{
    csl;
    int n,d,f,i;
    cin>>n;
    sieve();
    while(n--)
    {
        cin>>d;
        f = 0;
        for(i=1;i<=d;i++)
        {
            if(isPrime[i]==1 && f==0)
            {
                f = 1;
                continue;
            }
            if(isPrime[i]==1 && f==1)
                f = 0;
        }
        if(f==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
            
    }
	return 0;
}