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) {
        int maxFoundPrime = 0;
        int[] primes = new int[10000];
        primes[0] = 2;
        int index = 1;
        for (int i = 3; i <=100000; i=i+2){
            if (primeNumber(i)){
                primes[index++] = i;
                primes[index] = Integer.MAX_VALUE;
            }
        }
        
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            int countPrime = 1;
            if (n == 1){
                System.out.println("Bob");
            } else if (n == 2){
                System.out.println("Alice");
            } else {
                while (n > primes[countPrime]){
                    // System.out.println("" + primes[countPrime] + " + " + primes[countPrime+1] + " + " + countPrime);
                    countPrime++;
                }
                if (n != primes[countPrime]) --countPrime;
                // System.out.println("" + n + " + " + countPrime);
                if (countPrime % 2 != 0)
                    System.out.println("Bob");
                else
                    System.out.println("Alice");
            }            
        }
    }
    
    public static boolean primeNumber (int n){
        boolean prime = ((n == 2) || ((n > 2) && (n % 2 != 0)));
        int d = 3;
        while ((d <= Math.sqrt(n)) && prime){
            if (n % d == 0){
                prime = false;
            } else {
                d += 2;
            }
        }
        return prime;
    }
}