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

public class Solution {
    
    public LinkedList<Integer> foundPrime(int n){
        LinkedList<Integer> p=new LinkedList<Integer>();
        int c;
        for(int i=2;i<=n;i++){
            c=0;
            for(int j=2;j<=i;j++){
                if(i%j==0){c++;}
            }
            if(c==1){
                p.add(i);
            }
        }
        return p;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Solution s=new Solution();
        int g = in.nextInt();
        for(int a0 = 0; a0 < g; a0++){
            int n = in.nextInt();
            // your code goes here
            int[] a=new int[n];
            for(int i=0;i<n;i++){
                a[i]=i+1;
            }
            boolean alice=true;
            LinkedList<Integer> p=s.foundPrime(n);
            String winner;
            if(p.size()==0){
                winner="Bob";
            }
            else{
                while(p.size()!=0){
                    int k=(int)p.removeFirst();
                    for(int i=0;i<n;i++){
                        if((a[i]%k==0)&&(a[i]!=0)){
                            a[i]=0;
                        }
                    }
                    alice=!alice;
                }
                if(alice){
                    winner="Bob";   
                }
                else{
                    winner="Alice";
                }
            }
            System.out.println(winner);
        }
    }
}