#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

long int SieveOfEratosthenes(long int );
int main() {
    int g;
    cin>>g;
    for(int t=0;t<g;t++)
        {
        long int n;
        cin>>n;
        long int count=SieveOfEratosthenes(n+1);
        if((count%2)==0)
            cout<<"Bob"<<endl;
        else
            cout<<"Alice"<<endl;
    }
    return 0;
}
long int SieveOfEratosthenes(long int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    for (long int i=2; i<n; i++)
    {
        prime[i]=true;
    }
    long int count=0;
    for (long int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (long int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    for(long int i=2;i<n;i++)
        {
        if(prime[i]==true)
        count++;
    }

    return(count);
}