#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int SieveOfEratosthenes(int n,int arr[])
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    int j=0;
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i++] = false;
        }
    }
 
    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          arr[j++]=p;
return j;
}
int main(){
    int g,m; 
    scanf("%d",&g);
    for(int a0 = 0; a0 < g; a0++){
        int n; 
        scanf("%d",&n);
        int arr[n];
        if(n==1)
               printf("Bob\n");
        else{
              m=SieveOfEratosthenes(n,arr); 
            
            if(m%2==0)
                printf("Bob\n");
            else printf("Alice\n");
        }
        
    }
    return 0;
}