import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution 
    {
        Stack<Integer> st=new Stack<Integer>();
	 void mp(int n)
	    {
	       
	        boolean prime[] = new boolean[n+1];
	        for(int i=0;i<n;i++)
	            prime[i] = true;
	         
	        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 i = 2; i <= n; i++)
	        {
	            if(prime[i] == true)
	                st.push(i);
	        }
	    }
	     
       public static void main(String args[])
        {
       Scanner s=new Scanner(System.in);
        int a=s.nextInt();
        Solution g=new Solution();
        for(int i=0;i<a;i++)
        {
            int n=s.nextInt();
           
	        g.mp(n+1);
	        if(g.st.size()%2==0)
	        {
	        	System.out.println("Bob");
	        }
	        else
	        {
	        	System.out.println("Alice");
	        }
            g.st.removeAllElements();
        }
    
    }
}