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) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        int[] Table = new int[100001];
        boolean[] isPrime = new boolean[100001];
        Arrays.fill(isPrime,true);
        
        for(int factor=2; factor*factor<=isPrime.length; factor++){            
            if(isPrime[factor]){
                for(int j=2;factor*j<isPrime.length; j++){
                    isPrime[factor*j]=false;
                }
            }
        }
        
        int count=0;
        for(int i=2;i<Table.length; i++){
            if(isPrime[i]) ++count;
            Table[i]= count;
        }
        
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            
            if(Table[n]%2==0) System.out.println("Bob");
            else System.out.println("Alice");
            
        }
    }
}