import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.SortedSet;
import java.util.TreeSet;
import java.util.stream.IntStream;

public class B {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
        TreeSet<Integer> pps = generate();
		IntStream.range(0, n).forEach((int i) -> {
			int g = sc.nextInt();
            SortedSet<Integer> pp = pps.subSet( 2, g + 1 );
            System.out.println( pp.size() % 2 == 1 ? "Alice" : "Bob" );
		});
	}

    private static TreeSet<Integer> generate() {
        ArrayList<Integer> pp = new ArrayList<>(256);
        IntStream.rangeClosed( 2, 100_000 ).filter( i -> BigInteger.valueOf( i ).isProbablePrime( 1000 ) ).forEach( pp::add );
        TreeSet<Integer> pps = new TreeSet<>(pp);
        return pps;
    }
}