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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            
           int count=0;
            int[] a=new int[n];
            
            for(int i=0;i<=n-1;i++)
                {
                a[i]=i+1;                                  
            }
           
            boolean m=true;
            
            while(m)
                {
                int found=0;int no=-1;
                for(int i=1;i<=n-1;i++)
                    {
                    if(a[i]!=-1 && isprime(a[i]))
                        {
                        found=1;
                        no=a[i];
                    }
                                        
                }
                
                if(found==1)
                    {
                    
                    for(int i=1;i<=n-1;i++)
                        {
                        if(a[i]%no==0)a[i]=-1;
                    }
                }
                
                if(found==0)
                    {
                    break;
                }
                
                count++;
        
            }
            
            
            
            
            
            if(count%2==0)System.out.println("Bob");
                else
                System.out.println("Alice");
            
            
            
            
            
            
            
            
            
            
            // your code goes here
        }
    }
    
    
    public static boolean isprime(int a)
        {
        
        for(int i=2;i<a;i++)
            {
            if(a%i==0)return false;
            
        }
        
        
        return true;
        
        
        
    }
}