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();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            // your code goes here
            int count = 0;
            for(int i = 1; i <= n; i++){
                boolean prime = checkPrime(i);
                if(prime){
                    count++;
                }
            }
            /*if(count == 0){
                System.out.println("Alice");
            }else */
                if(count%2 == 0){
                System.out.println("Bob");
            }else{
                System.out.println("Alice");
            }
        }
    }
    
    public static boolean checkPrime(int i){
        if(i == 1){
            return false;
        }
        if(i == 2){
            return true;
        }
        if(i == 3){
            
            return true;
        }
        for(int j = 2; j <= i/2; j++){
            if(i%j == 0){
                return false;
            }
        }
        return true;
    }
    
}