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

public class Solution {

    public static String findWinner(int n) {
        int turn = 0;
        int winner = 0;
        
        if(n == 1) {
        	return "Bob";
        }
        
        List<Integer> list = new LinkedList<>();
        for(int i = 2; i <= n; i++) {
        	list.add(i);
        }
        
        while(true) {
            ++turn;
            boolean foundPrime = false;
            
            for(int i = 0; i < list.size(); i++) {
                BigInteger k = new BigInteger(String.valueOf(list.get(i)));
                if(k.isProbablePrime(1)) {
                    foundPrime = true;
                    
                    // let's remove all it's multiples
                    int num = list.get(i);
                    for(int j = i; j < list.size(); j++) {
                    	if(list.get(j) % num == 0) {
                    		list.remove(j);
                    	}
                    }
                    break;
                }
            }
            
            // Did not find a prime in this turn
            if(!foundPrime) {
                winner = turn % 2;
                break;
            }          
        }
        
        String winnerName = ""; // winner == 1 => Bob AND winner == 0 => Alice
        if(winner == 1) {
            winnerName = "Bob";
        } else {
            winnerName = "Alice";
        }
        
        return winnerName;
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        int []a = new int[g];
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            a[a0] = n;
        }
        
        for(int i = 0; i < a.length; i++) {
            int n = a[i];
            String winner = findWinner(n);
            System.out.println(winner);
        }
    }
}