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();
            int numPrimes = 0;
            boolean [] primes = new boolean[100000]; 
            Arrays.fill(primes,true);
            primes[0]=primes[1]=false;
            for (int i=2;i<primes.length;i++) {
                if(primes[i]) {
                    for (int j=2;i*j<primes.length;j++) {
                        primes[i*j]=false;
                    }
                }
            }
            for (int j=0;j<=n;j++) {
                    if(primes[j]) {
                        numPrimes+=1;
                    }
                }
            if(numPrimes%2 == 1){
                        System.out.println("Alice");
                    }
                    else{
                        System.out.println("Bob");
                    }
        }
        
    }
}