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 pcount=0;
            boolean prime[] = new boolean[n+2];
            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;
            }
        }
        for(int i = 2; i <= n; i++)
        {
            if(prime[i] == true)
                pcount++;//System.out.print(i + " ");
        }
            /*if(n>=2){
                pcount=1;
            }
            for(int i=3;i<=n;i=i+2){
                boolean f = false;
                for(int j=2;j<=Math.sqrt(i);j++){
                    if(i%j == 0){
                        f = true;
                        break;
                    }
                }
                if(!f){
                    pcount++;
                    //System.out.println(i);
                }
            }*/
            if(pcount%2 == 0){
                System.out.println("Bob");
            }
            else{
                System.out.println("Alice");
            }
        }
    }
}