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

public class Solution {
    
public static int fillSieve(int n) {
    boolean[] primes=new boolean[n+1];
    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;
            }
        }
    }
    int r=0;
     for (int i=2;i<primes.length;i++) {
       if(primes[i]) {
            r++;
     }
        
}
     return r;
}
    
  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 k=fillSieve(n);
            
            if(k%2==1)
            System.out.println("Alice");
            else
            System.out.println("Bob");
            
        }
    }
}