#include <bits/stdc++.h>
 
using namespace std;
void SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    
 prime[1]=false;
    for(int i=0;i<=n;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
    int count=0;
  for(int p=2;p<=n;p++){
      if(prime[p]) count++;
  }
      if(count&1) cout<<"Alice";
        else cout<<"Bob";
}
int main() {
	
	// your code here
    int n;
    cin>>n;
    
    while(n--){
       
	int l,t;
	cin>>t;
        SieveOfEratosthenes(t);
       // cout<<num;
           
        //cout<<count;
     
       //cout<<coun;
    cout<<endl;
    }
	return 0;
}