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();
             if(countPrimes(n) % 2 == 0) {
                 System.out.println("Bob");
             } else {
                 System.out.println("Alice");
             }
        }
    }
    
    public static int countPrimes(int n) {
        List<Integer> primes = new ArrayList<>();
        for(int i = 2; i <= n; i++) {
            final int j = i;
            if(!primes.stream().anyMatch(p -> j % p == 0)) {
                primes.add(j);
            }
        }

        return primes.size();
    }
}