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

public class Solution {
    
    public static Map<Integer,ArrayList<Integer>> cache = new HashMap<Integer,ArrayList<Integer>>();
    
    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();
            boolean isAliceTurn = true;
            ArrayList<Integer> set = calcPrimes(n);
            //System.out.println("Primes: "+ set.toString());
            if(set.size() % 2 == 0) {
                System.out.println("Bob");
            } else {
                System.out.println("Alice");
            }
        }
    }
    
    public static ArrayList<Integer> calcPrimes(int range) {
        if(cache.get(range) == null) {
            ArrayList<Integer> primes = new ArrayList<>();
            boolean isPrime = true;
            //System.out.println("Bound is "+ range);
            for(int i = 2; i <= range; i ++) {
                //System.out.println("Checking "+i);
                isPrime = true;
                for(int j = 2; j < i; j++) {
                    if((i % j) == 0) {
                        //System.out.println(i+" is not prime.");
                        isPrime = false;
                        break;
                    }
                }
                if(isPrime) {
                    primes.add(i);
                }
            }
            cache.put(range,primes);
        }
        return cache.get(range);
    }
}