#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    int g; 
    scanf("%d",&g);
    while(g--){
        long int n; 
        scanf("%ld",&n);
        int b[n],i;
        int new_flag=0;
        // your code goes here
        int prime[n+2];
        for(i=0;i<n+1;i++)prime[i]=1;
        for (int p=2; p*p<=n+1; p++)
        {
            // If prime[p] is not changed, then it is a prime
            if (prime[p] == 1)
            {
                // Update all multiples of p
                for (int i=p*2; i<=n+1; i += p)
                    prime[i] = 0;
            }
        }
        
        for(i=1;i<n;i++){
            if(prime[i+1]==1){
                if(new_flag==0)new_flag = 1;
                else new_flag=0;
                //printf("Test\n");
                
            }
        }
        if(new_flag==0)printf("Bob\n");
        else printf("Alice\n");
        //for(int i=0;i<10;i++)printf("Prime :- %d\n",prime[i]);

    }
    
    return 0;
}