import java.util.*;
import java.math.*;

public class Solution 
{
    public static boolean checkprime(int n)
        {
        if(n == 2)
            return true;
        if(n%2==0)
            return false;
        for(int i=3; i*i<=n; i+=2)
            if(n%i == 0)
                return false;
            
        return true;
    }
    public static void main(String[] args) 
    {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        while(g-->0)
        {
            int n = in.nextInt();
            int total = 0;
            for(int i=2; i<=n; i++)
                if(checkprime(i))
                    total++;
                
            if(total % 2 == 0)
                System.out.println("Bob");
                else
                System.out.println("Alice");
        }
    }
}