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

public class Solution {

    public static boolean isPrime(int num) {
        if (num< 2) return false;
        for (int i=2; i<=num/2; i++) {
            if (num%i==0)
                return false;
        }
        return true;
    }
    
    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();
            int count = 0;
            for (int i=1;i<=n;i++) {
                if (isPrime(i)) count++;
            }
            System.out.println(count%2==0 ? "Bob" : "Alice");
        }
    }
}