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

public class Solution {
    
    static boolean isPrime(int n) {
        if (n == 1) return false;
        
        for(int i=2;i<n;i++) {
            if(n%i==0)
                return false;
        }
        return true;
    }
    
    static int getPrime(List<Integer> numbers) {
        for (int i = 0; i < numbers.size(); i++) {
            if (isPrime(numbers.get(i))) {
                return numbers.get(i);
            }
        }
        return -1;
    }

    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();
            
            boolean alice = true;
            
            List<Integer> numbers = IntStream.range(1, n + 1).boxed().collect(Collectors.toList());
            
            int prime = getPrime(numbers);
            while (prime != -1) {
                int p = prime;
                numbers = numbers.stream().filter(v -> v % p != 0).collect(Collectors.toList());
                
                alice = !alice;
                prime = getPrime(numbers);
            }
            
            if (alice) {
                System.out.println("Bob");
            } else {
                System.out.println("Alice");
            }
        }
    }
}