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) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        
        boolean[] isPrime = new boolean[100001];
        for(int i = 2;i<isPrime.length;i++){
            isPrime[i] = true;
        }
        for(int i = 2;i<Math.sqrt(isPrime.length);i++){
            if(isPrime[i]){
                for(int j = i+i;j<isPrime.length;j+=i){
                    isPrime[j] = false;
                }
            }
        }
        int[] primeCount = new int[100001];
        boolean previous = false;
        for(int i = 1;i<primeCount.length;i++){
            if(isPrime[i]){
                primeCount[i]+=(primeCount[i-1]+1);    
            }
            else primeCount[i]+=primeCount[i-1];
        }
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if(primeCount[n]%2!=0) System.out.println("Alice");
            else System.out.println("Bob");
        }
    }
}