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

public class Solution {
    
    static int prime(int n){
        int prime=1; 
        int j=1;
        if(n==1)
            return 0;
        if(n==2)
            return 1;
        
        for(int i=2;i<=n;i++){          
               for(int k=2;k<=i;k++){ 
                   if (i%k==0){   
                       ///System.out.println( j+ " not prime");    
                       break;                   
                   }
                    prime++;
                                       
               }          
            
             //  System.out.println(j );
              
        }
    return prime; 
    }

    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();
                      
            System.out.println((prime(n)%2!=0)? "Alice":"Bob");
                               
        }
        
        long startTime = System.currentTimeMillis();
        long endTime   = System.currentTimeMillis();
        long totalTime = endTime - startTime;
       // System.out.println("totalTime "+totalTime);
    }
}