#include <bits/stdc++.h>
using namespace std;

int SieveOfEratosthenes(int n)
{

    bool prime[n+1];
    int cou=0;
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=n; p++)
    {

        if (prime[p] == true)
        {

            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }


    for (int p=2; p<=n; p++)
       if (prime[p])
        cou++;

          return cou;
}


int main()
{
    int t;
    cin>>t;
    while(t!=0)
    {
   int n;
   cin>>n;
    int p= SieveOfEratosthenes(n);
    if(p%2==0)
    {

        cout<<"Bob"<<endl;}
        else
            cout<<"Alice"<<endl;

        t--;
    }

}