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

public class Solution {

    static boolean prime(int a){
        if(a == 2)
            return true;
        if(a == 1 || a%2 == 0)
            return false;
        for(int i=3; i<=Math.sqrt(a); i+=2){
            if(a%i == 0)
                return false;
        }
        return true;
            
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        int max = 0;
        Set<Integer> prime = new HashSet<Integer>();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            int c = 0;
            
            for(int i = 1; i<=n; i++){
                if(i <= max){
                    if(prime.contains(i)){
                    //    System.out.println(i);
                        c++;
                    }
                }else{
                    if(prime(i)){
                        c++;
                        prime.add(i);
                    }       
                    max = i;
                }
         
            }
            //System.out.println(c);
            if(c%2 == 0){
                System.out.println("Bob");
            }else{
                System.out.println("Alice");
            }
            // your code goes here
        }
    }
}