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

public class Solution {

    public static int sieveOfEratosthenes(int target)
    {
       final boolean[] nonPrime = new boolean[target + 1];

      for (int i = 2; i <= Math.sqrt(target); ++i) {
        if (!nonPrime[i]) {
            for (int j = i * 2; j <= target; j += i) {
                nonPrime[j] = true;
            }
         }
       }

        final List<Integer> primes = new ArrayList<>();

        for (int i = 2; i <= target; ++i) {
        if (!nonPrime[i]) primes.add(i);
        }


        
        return primes.size();
        
        
    }
     
    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 count=0;
            count =sieveOfEratosthenes(n);
            if(count%2!=0)
                System.out.println("Alice");
            else
                System.out.println("Bob");
            // your code goes here
        }
    }
}