#include<bits/stdc++.h>
using namespace std;
int  SieveOfEratosthenes(int n)
{
    int tp=0;
    bool prime[n+1];
    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])
          {
              tp++;
          }
 return tp;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
    int n;
    cin>>n;
    if(n==1)
        cout<<"Bob"<<endl;
    else
    {

    int prim=SieveOfEratosthenes(n);
       if(prim%2!=0)
        cout<<"Alice"<<endl;
       else
        cout<<"Bob"<<endl;
    }
    }
    return 0;
}