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) {
        PrintWriter p=new PrintWriter(System.out);
        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
            if(n==1) p.println("Bob");
            else{
                
                int x=p(n);
                if((x&1)==0)
                    p.println("Bob");
                else
                    p.println("Alice");
                
            }
        }
        p.close();
    }
    static int p(int max) {
	    boolean[] isComposite = new boolean[max + 1];
	    
	    for (int i = 2; i * i <= max; i++) {
	        if (!isComposite [i]) {
	            for (int j = i; i * j <= max; j++) {
	                isComposite [i*j] = true;
	            }
	        }
	    }
	    int numPrimes = 0;
	    for (int i = 2; i <= max; i++) {
	        if (!isComposite [i]) numPrimes++;
	    }
	    
	    return numPrimes;
	}
}