import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            String pl="Bob";
            int n = in.nextInt();
            int[] x=new int[n];
            for(int j=1; j<=n; j++)
                x[j-1]=j;
            while(conPr(x)){
                int bprm=0;//Base Prime
                for(int i=0; i<x.length; i++)
                    if(isPrime(x[i])){bprm=x[i];break;}
                for(int i=0; i<x.length; i++)
                    if(x[i]%bprm==0)x[i]=1;
                pl=swapName(pl);
           }
                System.out.println(pl);
        }
            
            
        }
    
    private static boolean conPr(int[] x){
        for(int i=0; i<x.length; i++)
            if(isPrime(x[i]))return true;
        return false;
    }
    private static String swapName(String x){
        if(x.equals("Alice"))return "Bob";
        else return "Alice";
    }
    private static boolean isPrime(int x){
        if(x==1 || x==0)return false;
        if(x==2)return true;
        if(x%2==0)return false;
        for(int i=3; i<=x/2; i+=2)
            if(x%i==0)return false;
        return true;
    }
}