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

public class Solution {
    static Map<Integer, Integer> nrOfPrimes = new HashMap<>();
    static int upTo = 1;
    static List<Integer> knownPrimes = new ArrayList<>();

    public static void main(String[] args) {
        nrOfPrimes.put(1,0);
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if (upTo<n){
                countPrimes(n);
            }
            System.out.println(nrOfPrimes.get(n)%2==0 ? "Bob":"Alice");
        }
    }
    
    public static void countPrimes(int n){
        int cur = nrOfPrimes.get(upTo);
        for (int i = upTo+1; i<=n; i++){
            int temp = i;
            if (!knownPrimes.stream().anyMatch(x -> temp%x==0)) {
                cur++;
                knownPrimes.add(i);
            }
            nrOfPrimes.put(i, cur);
            upTo=i;
        }        
    }
}