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(),size=0;
            // your code goes here
            
            for (int i = 1; i <= n; i++) {

                boolean isPrimeNumber = true;

                // check to see if the number is prime
                for (int j = 2; j < i; j++) {
                    if (i % j == 0) {
                        isPrimeNumber = false;
                        break; // exit the inner for loop
                    }
                }

                // print the number if prime
                if (isPrimeNumber) {
                    size++;
                }
            }
            if(size%2==0)   System.out.println("Alice");
            else            System.out.println("Bob");
        }
    }
}