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 i = 0; i < g; i++){
            int n = in.nextInt();
          
    boolean prime[] = new boolean[n+1];
    
            for(int j = 0;j<n+1;j++){
                prime[j] = true;
            }
 
    for (int p=2; p*p<=n; p++)
    {
        
        if (prime[p] == true)
        {
            
            for (int k=p*2; k<=n; k += p)
                prime[k] = false;
        }
    }
 
            int c = 0;
   
    for (int p=2; p<=n; p++){
        if (prime[p])
          c++;
    }
        
        
        
        if(c%2 == 0){
        System.out.println("Bob");
    }else{
        System.out.println("Alice");
    }
        
        
        }
        
        
        
    }
    
    
}