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

public class Solution3 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int g = in.nextInt();
        boolean flag = false;
        for (int a0 = 0; a0 < g; a0++) {
            int n = in.nextInt();
            flag = false;
            int a[] = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = i + 1;
            while (true) {
                int k = nextPrime(a);
                if (k == -1)
                    break;
                else
                    a[k - 1] = 0;
                flag=!flag;
            }
            if (flag)
                System.out.println("Alice");
            else
                System.out.println("Bob");
        }
    }

    private static int nextPrime(int[] a) {
        if (a.length == 1)
            return -1;
        for (int i = 1; i < a.length; i++) {
            if (a[i] != 0 && isPrime(a[i]))
                return a[i];
        }
        return -1;
    }

    static boolean isPrime(int n) {
        if (n == 1 || n == 0)
            return false;
        if (n == 2)
            return true;
        for (int i = 2; i < Math.sqrt(n) + 1; i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }
}