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

		boolean[] pr = new boolean[100001];
		Arrays.fill(pr, true);
		pr[0] = false;
		pr[1] = false;
		for (int i = 2; i < pr.length; i++) {
			boolean isPrime = true;
			for (int j = 2; j * j <= i; j++) {
				if (i % j == 0) {
					// pr[i]=false;
					isPrime = false;
					break;
				}
			}
			pr[i] = isPrime;
		}
		for (int a0 = 0; a0 < g; a0++) {
			int n = in.nextInt();
			int m = 0;
			for (int i = 1; i <= n; i++) {
				if (pr[i]) {
					m++;
				}
			}
			if (m % 2 == 0) {
				System.out.println("Bob");
			} else {
				System.out.println("Alice");
			}
		}
	}
}