#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 = 2, i = 0, cnt = 0, b = 0;
        int *primes = (int *)malloc((n + 10)*sizeof(int));
        int *ptr = primes;
        for (i = 0; i < n + 1; i++) {
            *ptr++ = i;
        }
        // find the primes
        while (prime <= n / prime) {
            for (i = prime; prime * i <= (n); i++) {
                primes[prime * i] = 0;
                b = 1;
            }
            if (b){
                cnt++;
                b = 0;
            }
            for (prime = prime + 1; primes[prime] == 0 && prime <= n; prime++);
            //printf("%d ", prime);
        }
        for (i = prime; i <= n; i++) {
            if (primes[i]) cnt++;
        }
        //printf("%d\n", cnt);
        if (cnt & 1) {
            printf("Alice\n");
        }
        else {
            printf("Bob\n");
        }
        free(primes);
    }
    return 0;
}