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

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        ArrayList a = new ArrayList();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            
            boolean[] isPrime = new boolean[n+1];
            for (int i = 2; i <= n; i++) {
                isPrime[i] = true;
            }

     
            for (int f = 2; f*f <= n; f++) {
                if (isPrime[f]) {
                    for (int j = f; f*j <= n; j++) {
                        isPrime[f*j] = false;
                    }
                }
            }

      
            int primes = 0;
            for (int i = 2; i <= n; i++) {
                if (isPrime[i]) primes++;
            }
        
            if(primes%2==1){
                a.add("Alice");
            }else{
                a.add("Bob");
            }
        }
        for(int i=0;i<a.size();i++){
            System.out.println(a.get(i));
        }
        }
    
}