import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

	public boolean isPrime(int num) {
		boolean isPrime = true;
		for (int i = 2; i < num; i++) {
			if (num % i == 0) {
				isPrime = false;
				break;
			}
		}
		return isPrime;
	}

	public int getNumberOfPrimeNUmbers(int num) {
		int nop = 0;
		for (int i = 2; i <= num; i++) {
			if (isPrime(i)) {
				nop++;
			}
		}
		return nop;
	}

	public static void main(String[] args) {

		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();

		for (int i = 0; i < n; i++) {
			int num = scanner.nextInt();
			Solution sillyGame = new Solution();
			int nop = sillyGame.getNumberOfPrimeNUmbers(num);
			if (nop % 2 == 0) {
				System.out.println("Bob");
			} else {
				System.out.println("Alice");
			}
		}

	}
}