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

public class Solution {

    static boolean checkPrime(int n)
    {
        boolean flag = true;
        for(int i=3;i<=Math.sqrt(n);i+=2)
        {
                if(n%i==0)
                {
                    flag = false;
                    break;
                }
        }
        return flag;
    }
    
    static int numberOfPrimes(int n)
    {
        if(n==1)
            return 0;
        if(n==2)
            return 1;
        int count=1;
        for(int i=3; i<=n;i+=2)
        {
            if(checkPrime(i))
                count++;
        }
        return count;
    }
    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 turns = numberOfPrimes(n);
            if(turns%2==0)
                System.out.println("Bob");
            else
                System.out.println("Alice");
        }
    }
}