import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
       
    	public static boolean isPrime(int n)
	{
	     if (n <= 1)  return false;
	    if (n <= 3)  return true;
	    if (n%2 == 0 || n%3 == 0) return false;
	 
	    for (int i=5; i*i<=n; i=i+6)
	        if (n%i == 0 || n%(i+2) == 0)
	           return false;
	 
	    return true;
	}
    
    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();
            int l=0;
           // Vector<Integer> vec = new Vector<Integer>;
            for(int i=2;i<=n;i++)
		{
			if(isPrime(i)){
				
                l++;
            }
		}
            if(l%2==0)
                System.out.println("Bob");
            else
                System.out.println("Alice");
            // your code goes here
        }
    }
}