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 countPrime=0;
            int n = in.nextInt();
            for(int i=2;i<=n;i++){
                if(isPrime(i)){
                    countPrime++;
                   // System.out.println("isPrime "+i);
                }
            }
           // System.out.println("countPrime "+countPrime);
            if(countPrime % 2 == 0){
                System.out.println("Bob");
            }
            else{
                 System.out.println("Alice");
            }
        }
    }
    private static boolean isPrime(int a){
    boolean prime=true;
	for(int i=2;i<=a/2;i++)
	{
	   if(a%i ==0)
	   {
	      prime=false;
	      break;
	   }
	}
        return prime;
    }
}