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 sc = new Scanner(System.in);

		int num_games = sc.nextInt();
		for (int i = 0; i < num_games; i++) {
			int n = sc.nextInt();
			boolean playerFlag = false; // player = Alice
			List<Integer> list = new ArrayList<Integer>();
			for (int j = 1; j <= n; j++) {
				list.add(j);
			}
			// get next prime num
			while (list.size() > 0) {
				int tempPrime = nextPrime(list);
				if(tempPrime == -1){
					break;
				}
				for(int k=0;k<list.size();k++){
					if(list.get(k)%tempPrime == 0){
						list.remove(k);
					}
				}
				playerFlag = !playerFlag;
			}
			if(playerFlag){
				System.out.println("Alice");
			} else{
				System.out.println("Bob");
			}

		}
    }
    
    public static int nextPrime(List<Integer> list) {
		for (int i = 0; i < list.size(); i++) {
			boolean flag = false;
			for (int j = 2; j < i; j++) {
				if (list.get(i) % j == 0) {
					flag = true;
				}
			}
			if (!flag && i!=0) {
				return list.get(i);
			}
		}

		return -1;
	}
}