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

class Solutionsdss {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        int c=0;
        
        
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            // your code goes here
            c=0;
           boolean prime[] = new boolean[n+1];
        for(int i=0;i<n+1;i++)
            prime[i] = true;
         
        for(int p = 2; p*p <=n; p++)
        {
            // If prime[p] is not changed, then it is a prime
            if(prime[p] == true)
            {
                // Update all multiples of p
                for(int i = p*2; i <= n; i += p)
                    prime[i] = false;
            }
        }
         
        // Print all prime numbers
        for(int i = 2; i <= n; i++)
        {
            if(prime[i] == true)
                c++;
        }               

           if(c%2==0)
                System.out.println("Bob");
           else
                System.out.println("Alice");
        }
    }
}