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();
            // your code goes here
            
            boolean[] primes = findPrimes(n);
            int count = 0; 
            for(boolean b : primes){
                if(b){
                    count++;
                }                                   
            }
            //System.out.println(Arrays.toString(primes));
            System.out.println(count %2== 0 ? "Bob" : "Alice");
        }
        
        
       
    }
    
    
    static boolean[] findPrimes(int n){
        boolean[] primes = new boolean[n+1];
        for(int i = 0; i <= n; i++){
            primes[i] = true;
        }
        primes[0] = false;
        if(n >= 1){
            primes[1] = false;
        }
        int sqrt = (int)Math.sqrt(n);
        for(int i = 2; i <= sqrt; i++){
          
            
            for(int j = i+i; j <= n; j+=i){
                primes[j] = false;
            }
        }
        
        return primes;
    }
}