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

public class Solution {

    public static int c = 0;
    public static int p = 0;
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            System.out.println(getWinner(n));
        }
    }
    
    public static String getWinner(int n) {
        
        if (n == 1) return "Bob";
        if (n == 2) return "Alice";
        
        int count = 0;
        String winner = "";
        int start = 1;
        
        if (n >= p) {
            start = p + 1;
            p = n;
            count = c;
        }
        
        for(int i=start; i<=n; i++) {
            if (isPrime(i)) count++;
        }
        c = count;
        p = n;
    
        //System.out.println(count);
        if (count % 2 == 0) 
            winner = "Bob";
        else
            winner = "Alice";
        return winner;
    }
    
    public static boolean isPrime(int x) {
        if (x % 2 == 0) return false;
        
        for(int i=3; i*i<=x; i += 2) {
            if ((x % i) == 0 ) 
                return false;
        }
        return true;
    }
}