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 numPrimes = 0;
            int n = in.nextInt();
            for (int j = 2; j <= n; j++) {
                Boolean prime = true;
                for (int i = 2; i <= j/2; i++) {
                  if (j % i == 0)prime = false;
                }
              if (prime)numPrimes++; 
            }
            if (numPrimes % 2 == 1) {
              System.out.println("Alice");
            } else {
              System.out.println("Bob");
            }
        }
    }
}