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

public class Solution {
    
    
    
    public static int countPrimes(int n) {
        
        if(n<2){ return 0;}
        if(n==2){return 1;}
	List<Integer> primes = new ArrayList<>();

        // loop through the numbers one by one
        for (int i = 2; i <= n; i++) {
            boolean isPrimeNumber = true;

            // check to see if the number is prime
            for (int j = 2; j < i; j++) {
                if (i % j == 0) {
                    isPrimeNumber = false;
                    break; // exit the inner for loop
                }
            }

            // print the number if prime
            if (isPrimeNumber) {
                primes.add(i);
            }
        }
        return primes.size();
}

    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 count = Solution.countPrimes(n);
            if(count == 0)
                {
                System.out.println("Bob");
            }
            else
                {
                //System.out.println(count);
                if(count % 2 == 0)
                    {
                    System.out.println("Bob");
                }
                else
                    {
                    System.out.println("Alice");
                }
            }
        }
    }
}