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

public class Solution {

    final static int n = 100000;
    static boolean[] primes=new boolean[n+1];
    public static void fillSieve() {
        Arrays.fill(primes,true);
        primes[0]=primes[1]=false;
        for (int i=2;i<primes.length;i++) {
            if(primes[i]) {
                for (int j=2;i*j<primes.length;j++) {
                    primes[i*j]=false;
                }
            }
        }
    }

    public static void main(String[] args) {
        fillSieve();
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int k = in.nextInt();
            int sum = 0;
            for (int i = 1; i <= k; i++) {
                if ( primes[i]) {
                    sum ++;
                }
            }
            if (sum % 2 == 1) {
                System.out.println("Alice");
            } else {
                System.out.println("Bob");
            }
        }


    }
}