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

public class Solution {

    private static ArrayList<Integer> primes = new ArrayList<Integer>();
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        
        primes.add(2);
        for (int i = 3; i <= 100000; i += 2) {
            if (isPrime(i)) {
                primes.add(i);
            }
        }
        
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            int current = 0;
            while (current < primes.size() && primes.get(current) <= n) {
                current++;
            }
            //System.out.println(current);
            if ((current - 1) % 2 == 0) {
                System.out.println("Alice");
            } else {
                System.out.println("Bob");
            }
        } 
    }
    
    public static boolean isPrime(int n) {
        if (n % 2 == 0) {
            return false;
        }
        for (int i = 3; i <= Math.sqrt(n); i += 2) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }
}