#include <bits/stdc++.h>
using namespace std;
 
int SieveOfEratosthenes(int n)
{
    
    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;
        }
    }
    int h=0;
    
    for (int p=2; p<=n; p++)
       if (prime[p])
          h++;
    return h;      
}
 

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
    	int n;
    	cin>>n;
    	int x=SieveOfEratosthenes(n);
    	if(x%2==0)
    	{
    		cout<<"Bob"<<endl;
    	}
    	else
    	{
    		cout<<"Alice"<<endl;
    	}
    
    }
    
   
}