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();


            HashMap<Integer, Integer> range = new HashMap<Integer, Integer>();
            HashMap<Integer, Integer> prime = new HashMap<Integer, Integer>();
            for (int i = 1; i <= n; i++) {
                range.put(i, i);

                if(isPrime(i) && i > 1)
                {
                    prime.put(i, i);
                }
            }

            boolean alice = true;

            while(true) {
                int maxEliminate = 0, currentPrime = -1;

                for (Integer key : prime.keySet()) {
                    if (key == 1)
                        continue;

                    int eliminate = 1;

                    if (key * maxEliminate > n)
                        continue;

                    for (int i = key; i < n; i += key) {
                        if (range.containsKey(i))
                            eliminate++;
                    }

                    if (eliminate > maxEliminate)
                    {
                        maxEliminate = eliminate;
                        currentPrime = key;
                    }
                }

                if (currentPrime == -1) {
                    if (alice) {
                        System.out.println("Bob");
                    } else
                    {
                        System.out.println("Alice");
                    }

                    break;
                } else {
                    for (int i = currentPrime; i <= n; i += currentPrime) {
                        range.remove(currentPrime);
                        prime.remove(currentPrime);
                    }
                }

                alice = !alice;
            }
        }
    }
    
    public static boolean isPrime(int number)
    {
        for(int i=2;i<=number/2;i++)
        {
            int temp = number % i;
            if(temp==0)
            {
                return false;
            }
        }

        return true;
    }
}