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

public class Solution {

    public static int sieveOfEratosthenes(int n) {
        if(n < 2) {
            return 0;
        }
        int[] sieve = new int[n + 1];
        
        boolean finished = false;
        
        int p = 2;
        while(!finished) {
            removeMultiples(sieve, p);
            p = findNextPrime(sieve, p);
            if(p == 0) {
                finished = true;
                break;
            }
        }
        
        // count primes
        int count = 0;
        for(int i = 2; i < n + 1; i++) {
            if(sieve[i] == 0) count++;
        }
        
        return count;
    }  
    
    public static void removeMultiples(int[] sieve, int p) {
        for(int i = 2*p; i < sieve.length; i += p) {
            sieve[i] = 1;
        }
    }
    
    public static int findNextPrime(int[] sieve, int start) {
        for(int i = start + 1; i < sieve.length; i++) {
            if (sieve[i] == 0) return i;
        }
        return 0;
    }
    
    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();
            // your code goes here
            if((sieveOfEratosthenes(n) % 2) == 1) {
                System.out.println("Alice");
            } else {
                System.out.println("Bob");
            }
        }
    }
}