import java.util.Scanner;

public class AliceAndBobsSillyGame {
	static int arr[] = new int[100000];
	static int primes = 0;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		allPrimes(100000);
		while (n-- > 0) {
			int num = sc.nextInt();
			int count = 0;
			for (int i = 0; i < num; i++) {
                if(arr[i] == 0)
					break;
				else if(arr[i] <= num)
					count++;
				else if(arr[i] > num)
					break;
			}
			if(count % 2 == 0)
				System.out.println("Bob");
			else
				System.out.println("Alice");
			
		}
	}

	public static void allPrimes(int n) {
		
		boolean prime[] = new boolean[n + 1];
		for (int i = 0; i < n; i++)
			prime[i] = true;

		for (int p = 2; p * p <= n; p++) {
			if (prime[p] == true) {
				for (int i = p * 2; i <= n; i += p)
					prime[i] = false;
			}
		}

		for (int i = 2; i <= n; i++) {
			if (prime[i] == true){
				arr[primes++] = i;
			}
				
		}
	}
}