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) {
		// TODO Auto-generated method stub-
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		
		while(t-->0){
			int n = sc.nextInt();
			ArrayList<Integer> primes = sieveOfEratosthenes(n);
			
			if(primes.size() % 2 != 0) System.out.println("Alice");
			else System.out.println("Bob");
		}
	}
	
	public static ArrayList<Integer> sieveOfEratosthenes(int n){
		boolean primes[] = new boolean[n+1];
		for(int i=2; i<primes.length; i++){
			primes[i] = true;
		}
		
		for(int p=2; p*p<=n; p++){
			if(primes[p]){
				for(int i=p*2; i<=n; i+=p){
					primes[i] = false;
				}
			}
		}
		ArrayList<Integer> allPrimes = new ArrayList<>();
		for(int i=0; i<primes.length; i++){
			if(primes[i]){
				allPrimes.add(i);
			}
		}
		return allPrimes;
	}



}