#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);
    for(int a0 = 0; a0 < g; a0++){
        int n; 
        scanf("%d",&n);
        // your code goes here
        
           
        int prime[n+1];
    for(int i = 0; i < n+1; i++){
        prime[i] = 1;
    }
 
    for (int p=2; p*p<=n; 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; i += p)
                prime[i] = 0;
        }
    }
  
    int arr[10000];
    int index = 0;      //no of prime no
        
    // Print all prime numbers
    for (int p=2; p<=n; p++){
       if (prime[p]){
        arr[index] = p;
        index++;
        }
    }
    
    //printf("the no of prime no are %d\n", index);
    int c = index % 2;
    if(c == 0){
        printf("Bob\n");
    }
    else{
        printf("Alice\n");
    }
    }
    return 0;
}