#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int t,j,n = 100000;
    cin>>t;
    bool prime[n+1];
    for(j=1;j<=n;j++)
        prime[j] = true;
    
    for (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 (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    while(t--)
    {
        int n_;
        cin>>n_;
        int i=1,count = 0;
        for(i=1;i<=n_;i++)
            if(prime[i]==true)
                count++;
        if(count%2==0)
            cout<<"Alice\n";
        else
            cout<<"Bob\n";
    }
    return 0;
}