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 sc = new Scanner(System.in);
		 int n = sc.nextInt();
		 int arr [] = new int[n+1];
		 for(int i=1; i<= n; i++){
			 arr[i] = sc.nextInt();
		 }
		
		 int prime [] = new int [1001];
		 prime[0] = 0;
		 prime[1] = 0;
		 prime[2] = 1;
		 int count = 1;
		 boolean check = true;
		 
		 for(int i =3; i< 1000; i++){
			 check = true;
			 for(int j = 2; j< i; j++){
				 if(i%j == 0){
					 check = false;
					 break;
				 }
			 }
			 
			if(check){ 
				count = count+1;
				
			}
			
			prime[i] = count;
		 }
		 
		 for(int i=1; i<= n; i++){
			 if(prime[arr[i]]==0){
				 System.out.println("Bob");
			 }
			 else if(prime[arr[i]]%2 != 0){
				 System.out.println("Alice");
			 }else{
				 System.out.println("Bob");
				 
			 }
			 
			 
		 }
    }
}