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(); int a = sieve(n+1); if(a%2==0) System.out.println("Bob"); else System.out.println("Alice"); } } static int sieve(int n) { boolean prime[] = new boolean[n+1]; for(int i=0;i