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();
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        map.put(0,0);
        map.put(1,0);
        map.put(2,1);
        int idx = 3;
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            // your code goes here     
            int prime=0;
            if(n<idx){
                prime = map.get(n);
            } else {
                prime = map.get(idx-1);
                for (int i = idx; i <= n; i++){
                    if (isPrime(i) || i == 2){
                        prime++;    
                    }                    
                    map.put(i, prime);
                    idx++;
                }
                
            }                        
            if(prime%2==0){
                System.out.println("Bob");
            } else {
                System.out.println("Alice");
            }
            
        }
    }
    
    public static boolean isPrime(int num){
        if ( num > 2 && num%2 == 0 ) {            
            return false;
        }
        int top = (int)Math.sqrt(num) + 1;
        for(int i = 3; i < top; i+=2){
            if(num % i == 0){                
                return false;
            }
        }        
        return true; 
    }
}