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

public class Solution {
    
    public static boolean isPrime(int n){
        for(int i = 2; i <= Math.sqrt(n); i++){
            if(n % i == 0){
                return false;
            }
        }
        
        return true;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        
        int[] primeSums = new int[100001];
        int numPrimes = 0;
        for(int i = 2; i < primeSums.length; i++){
            if(isPrime(i)){
                numPrimes++;
            }
            primeSums[i] = numPrimes;
        }
        
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if(primeSums[n] % 2 == 0){
                System.out.println("Bob");
            }
            else{
                System.out.println("Alice");
            }
        }
    }
}