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

public class Solution {

   static  ArrayList<Integer> primes = new ArrayList<Integer>();
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        
        primes.add(2);
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if( n == 1)
            { System.out.println("Bob");
             
            }
            else if( primesLessThanN(n) % 2 == 0)
            {
                System.out.println("Bob");
            }
            else
        {
              System.out.println("Alice");
            }
                
        }
    }
    
    public static int primesLessThanN(int n)
    {
        if( n > primes.get(primes.size()-1))
        {
            for(int next = primes.get(primes.size()-1)+1; next <=n; ++next)
            {
                boolean prime = true;
                for(int i = 0; i < primes.size() && prime; ++i)
                {
                    if( next% primes.get(i) ==0)
                    {
                        prime = false;
                    }
                    
                    if( primes.get(i) * primes.get(i) > next)
                    {
                        break;
                    }
                    
                   
                }
                if(prime)
                {
                    primes.add(next);
                }
            }
        }
       // System.out.println(primes);
        
        int high = primes.size() ;
        int low = 0;
        while( low <  high-1)
        {
            int mid = (low+high)/2;
            //System.out.println("mid " + mid + " " + low + " " + high);
            if( primes.get(mid) <= n)
            {
                low = mid;
            }
            else
            {
                high = mid;
            }
        }
        return low+1;
    }
}