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();
        if((g>=1)&&(g<=1000)){
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if((n>=1)&&(n<=100000)){
                int p=firstprime(1,n);
                int count=1;
                do{
                   if((p==0)&&(((count%2)!=0)))
                   {System.out.println("Bob");
                   break;}
                else if((p==0)&&(((count%2)==0)))
                {System.out.println("Alice");
                break;}
                else{
                    p=firstprime(p+1,n);
                    count++;
                } 
                }while(p<=n);              
            }            
        }
        }
    }
    public static int firstprime(int x, int y)
        {
        int flag=0;
        for(int i=x;i<=y;i++){
            for(int j=1;j<=i;j++){
                if(i%j==0)
                    flag++;
            }
            if(flag==2)
                return i;
            else
                flag=0;
        }
        return 0;
    }    
}