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

public class Solution {
    
    private static int[] primesCount = new int[100001];
    static {
        int curCount = 0;
        for (int p = 2; p < primesCount.length; p++) {
            if(primesCount[p] == 0) {
                curCount++;
                for (int i = p * 2; i < primesCount.length; i += p) {
                    primesCount[i] = curCount;
                }
            }
            primesCount[p] = curCount;
        }
    }

    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();
            System.out.println(primesCount[n] % 2 == 0 ? "Bob" : "Alice");
        }
    }
}