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 size = 100001;
        boolean[] isPrime = new boolean[size]; 
        Arrays.fill(isPrime, true);
        isPrime[0] = false;
        isPrime[1] = false;
        
        int limit = (int) Math.sqrt(size-1);
        for (int i = 2; i <= limit; i++) {
            if (!isPrime[i]) continue;
            
            for (int j = i*i; j < size; j += i) {
                isPrime[j] = false;
            }
        }
        
        int[] dp = new int[size];
        for (int i = 2; i < size; i++) {
            if (isPrime[i]) {
                dp[i] = dp[i-1]+1;
            } else {
                dp[i] = dp[i-1];
            }
        }
        
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            
            int countPrime = dp[n];
            //odd -> Alice, even -> Bob
            if ((countPrime & 1) == 1) {
                System.out.println("Alice");
            } else {
                System.out.println("Bob");
            }
        }
    }
    
    public static int[] scanArray(int n, Scanner in) {
		int a[] = new int[n];
        for(int a_i=0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        return a;
	}
}