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

public class Solution {
    
    static HashSet<Integer> primes = new HashSet<Integer>();

    public static boolean isPrime(int n) {
        if (primes.contains(n)) return true;
        if (n == 1) {
            return false;
        }
        if (n>2 && n %2 == 0){
            return false;
        }
        for (int i = 3; i<=Math.sqrt(n); i+=2) {
            if (n%i == 0) {
                return false;
            }
        }
        primes.add(n);
        return true;
    }
    
    public static String whoWins(int n) {
        boolean turn = false; //false = alice
        for (int i = 1; i<=n; i++){
            if (isPrime(i)) {
                turn = !turn;    
            }
        }
        return turn?"Alice":"Bob";
    }

    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();
            System.out.println(whoWins(n));
        }
    }
}