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 p = 0;
            int n = in.nextInt();
            if(n==1)
                p=0;
            if(n==2)
                p=1;
            else
                p=prime(n);
            if(p%2==0)
                System.out.println("Bob");
            else
                System.out.println("Alice");
        }
    }
    public static int prime(int n){
        int flag=0;
        int p=0;
        int arr[] = new int[n+1];
        for(int i=2;i<=n;i++){
            if(arr[i]!=1){
                for(int j=2;j*i<=n;j++)
                    arr[i*j]=1;
            }
        }
                    for(int j=2;j<=n;j++){
            if(arr[j]==0)
                p++;
                    }
        return p;
    }
}