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

public class Solution {
    private static List<Integer> primes = new ArrayList<>();

    private static boolean isPrime(int n) {
        if (n == 0 || n == 1)
            return false;

        if (n == 2)
            return true;

        int sqrt = (int) Math.sqrt(n);
        for (int i = 2; i <= sqrt; ++i) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    private static void generatePrimes() {
        primes.add(0);
        primes.add(0);
        for (int i = 2; i < 100010; ++i)
            if (isPrime(i))
                primes.add(1 + primes.get(i - 1));
            else
                primes.add(primes.get(i - 1));
    }

    public static void main(String[] args) {
        generatePrimes();
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        while (g-- > 0) {
            int n = in.nextInt();
            System.out.println(primes.get(n) % 2 == 0 ? "Bob" : "Alice");
        }
    }
}