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

public class Solution{
    public static int prime(int limit) {
      
        
        int count=0;
      
        
        for(int number = 1; number<=limit; number++){
            
            if(isPrime(number)){
                   count++; 
            }
        } return count-1;

    }

    public static boolean isPrime(int number){
        for(int i=2; i<number; i++){
            if(number%i == 0){
                return false; 
            }
        }
        return true; 
    }
    

    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();
            // your code goes here
            int k=prime(n);
            if(k%2==0)
            {
             System.out.println("Bob");}
            else System.out.println("Alice");
        }
    }
}