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

public class Solution {

	public static boolean isPrime(int a) {
		if ( a == 1) return false;
		if ( a == 2) return true;
		for ( int i = 2; i < Math.sqrt(a) + 1;i++) {
			if ( a % i == 0) return false;
		}
		
		return true;
	}
	public static int getPrimes(int n) {
		List<Integer> primes = new ArrayList<>();
		int count = 0;
		for ( int i = 1 ; i <= n;i++) {
			if ( isPrime(i)) {
				count++;
				primes.add(i);
			}
		}
		return count;
	}
	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();
			// your code goes here
			int primeCount = getPrimes(n);
			if ( primeCount % 2 == 0 ) {
				System.out.println("Bob");
			} else {
				System.out.println("Alice");
			}
			
		}
	}
}