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

public class Solution {
    
    static int nPrimesLess(int n) {
        if(n < 2)
            return 0;
        boolean[] sieve = new boolean[(n+1)/2];
        sieve[1/2] = false;
        for(int p = 3; p <= n; p += 2)
            sieve[p/2] = true;
        
        for(int p = 1; p*p <= n; p += 2) {
            if(sieve[p/2]) {
                for(int q = p*2; q <= n; q += p*2)
                    sieve[q/2] = false;
            }
        }
        
        int nRet = 1;
        for(int p = 1; p <= n; p += 2)
            if(sieve[p/2])
                ++nRet;
        return nRet;
    }

    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();
            System.out.println(nPrimesLess(n) % 2 == 0 ? "Bob" : "Alice");
        }
    }
}