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 scan = new Scanner(System.in);
		int n = scan.nextInt();
		
		for(int i = 0; i < n; i++){
			int n1 = scan.nextInt();
			int numPrimes = primes(n1);
			if(numPrimes % 2 == 1){
				System.out.println("Alice");
			}
			else{
				System.out.println("Bob");
			}
		}
	}

	public static int primes(int n) {
		boolean[] primes = new boolean[n + 1];
		for (int i = 2; i < primes.length; i++) {
			primes[i] = true;
		}
		int num = 2;
		while (true) {
			for (int i = 2;; i++) {
				int multiple = num * i;
				if (multiple > n) {
					break;
				} else {
					primes[multiple] = false;
				}
			}
			boolean nextNumFound = false;
			for (int i = num + 1; i < n + 1; i++) {
				if (primes[i]) {
					num = i;
					nextNumFound = true;
					break;
				}
			}
			if (!nextNumFound) {
				break;
			}
		}
		int count = 0;
		for (int i = 0; i < primes.length; i++) {
			if (primes[i]) {
				count++;
			}
		}

		return count;
	}
}