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();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            boolean [] c=new boolean[n+1];
            for(int i=0;i<=n;i++){
                c[i]=true;
            }
            int [] primes=new int[n+1];
            int nop=0;
            int limit=(int)Math.sqrt(n);
            for(int i=2;i<=limit;i++){
                if(c[i]){
                    for(int j=i*i;j<=n;j=j+i){
                        c[j]=false;
                        //System.out.println(j);
                    }
                }
            }
            for(int i=2;i<=n;i++){
                if(c[i]){
                    primes[nop++]=i;
                }
            }
            //System.out.println(nop);
            
            if(nop%2==0){
                System.out.println("Bob");
            }
            else{
                System.out.println("Alice");
            }
        }
    }
}