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

public class Solution {
    
    private static int[] a = new int[100001];

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        a[1]=0;
        for (int i=2;i<100001;i++) {
            a[i]=a[i-1];
            if (isPrime(i)) a[i]++;
        }
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            int nrPrimesLowerThanN = a[n];
            
            if (nrPrimesLowerThanN % 2 == 0 ) { 
                System.out.println("Bob");
            } else {
                System.out.println("Alice");
            }
        }
    }
    
    
private static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;
        if (num > 3 && num%3 == 0) return false;
        if (num > 5 && num%5 == 0) return false;
        for (int i = 3; i * i <= num; i += 2)
            if (num % i == 0) return false;
        return true;
}
}