import java.util.Scanner;

public class Solution {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int t = scan.nextInt();
		for(int i=0;i<t;i++){
			int n = scan.nextInt();
	        boolean[] isPrime = new boolean[n+1];
	        for (int j = 2; j <= n; j++) {
	            isPrime[j] = true;
	        }

	       
	        for (int factor = 2; factor*factor <= n; factor++) {
	        	if (isPrime[factor]) {
	                for (int j = factor; factor*j <= n; j++) {
	                    isPrime[factor*j] = false;
	                }
	            }
	        }

	        int primes = 0;
	        for (int j = 2; j <= n; j++) {
	            if (isPrime[j]) primes++;
	        }
	        
	        if(primes%2==0){
				System.out.println("Bob");
			}
			else{
				System.out.println("Alice");
			}

	        
		}
	}

}