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();
            // your code goes here
            int primeNumbers=countPrimes(n);
            if(primeNumbers%2==0)
                System.out.println("Bob");
            else 
                System.out.println("Alice");
            
        }
    }
    
    public static int countPrimes(int n){
        int count=0;
       for(int i=2;i<=n;i++){
           if(isPrime(i))
            { //  System.out.println(i);
               count++;}   
       }
        return count;
    }
    
    public static boolean isPrime(int num){
        if(num>2){
        if(num%2==0)
            return false;
        for(int i=3;i*i<=num;i+=2){
            if(num%i==0)
                return false;
        }
        }
        return true;
    }
}