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

// Driver Program to test above function
int main()
{   int t;
    cin>>t;
    while(t--)
    {
    
    int n,count=0 ;
    cin>>n;
   // cout << "Following are the prime numbers smaller "
    //     << " than or equal to " << n << endl;
     bool prime[n+1];
  //  memset(prime, true, sizeof(prime));
    for(int i=0;i<n+1;i++)
	{
		prime[i]=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;
        }
    }
 
    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          count++;     
  //  cout<<count<<endl;
    
    if(n==1)
    cout<<"Bob"<<endl;
    else if(count%2==0)
    cout<<"Bob"<<endl;
    else
    cout<<"Alice"<<endl;
  }
    return 0;
 
}