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 n = in.nextInt();
            System.out.println(winner(n));
        }
    }
    
    public static String winner(int n) {
        int num = numPrimes(n);
        if (num % 2 == 0) return "Bob";
        return "Alice";
    }

    private static int numPrimes(int n) {
        int count = 0;
        boolean[] isNotPrime = new boolean[n+1];
        for (int i = 2; i < isNotPrime.length; i++) {
            if (!isNotPrime[i]) {
                count += 1;
                int runner = i * 2;
                while (runner < isNotPrime.length) {
                    isNotPrime[runner] = true;
                    runner += i;
                }
            }
        }
        return count;
    }
    
}