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

public class Solution {
    static void sieveOfEratosthenes(int n)
	{
		boolean prime[] = new boolean[n+1];
		for(int i=0;i<=n;i++)
			prime[i] = true;
		
		for(int p = 2; p*p <=n; p++)
		{
			if(prime[p] == true)
			{
				for(int i = p*2; i <= n; i += p)
					prime[i] = false;
			}
		}
		int counter=0;
		for(int i = 2; i <= n; i++)
		{
			if(prime[i] == true){
				counter+=1;
               // System.out.print(i+" ");   
            }
		}
        
        //System.out.println(counter);
        if(counter%2==0){System.out.println("Bob");}
        else System.out.println("Alice");
    }
    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();
            sieveOfEratosthenes(n);
        }
    }
}