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();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            if(n==1){
                System.out.println("Bob");
                continue;
            }
            if(n==2){
                System.out.println("Alice");
                continue;
            }
            int noOfPrimes = 0;
            boolean[] isNotPrime = new boolean[n+1];
            for(int i=2; i<=n; i++){
                if(!isNotPrime[i]){
                    isNotPrime[i] = true;
                    int j = 1;
                    noOfPrimes++;
                    while(j*i<=n){
                        isNotPrime[j*i] = true;
                        j++;
                    }
                }
            }
            if(noOfPrimes%2==1){
                System.out.println("Alice");
            }else{
                System.out.println("Bob");
            }
        }
    }
}