#include<bits/stdc++.h>

using namespace std;

typedef long long int ll;
void sieve(ll n)
{
    ll count=0;
    bool prime[n+1];
    memset(prime, true, n+1);

    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])
 		count++;
	 }
   
   

	
    if(n==1)
        cout<<"Bob"<<endl;
    else if(n==2)
       cout<<"Alice"<<endl; 
	else if(count%2==0)
	cout<<"Bob"<<endl;
	else if(count%2==1)
	cout<<"Alice"<<endl;
}

int main(){
	ll n,g;
	cin>>g;
	while(g--){
		cin>>n;
		sieve(n);
	}
	
	return 0;
	
}