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();
            if(simpleSieve(n+1)%2!=0){
                System.out.println("Alice");
            }else{            
                System.out.println("Bob");
            }
        }
        
    }
    public static int simpleSieve(int n){//returns all prime less than n
        int prime[]=new int[n];
        Arrays.fill(prime,1);
        for(int p=2;p*p<n;p++){
            if(prime[p]==1){
                for(int j=p*2;j<n;j+=p){
                    prime[j]=0;
                }
            }
        }
        int x=0;
        for(int i=2;i<n;i++){
            if(prime[i]==1){
                x++;
            }
        }
        return x;
    }
}