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

int seive(int num) {
    int size = num + 1;
    int count = 0, i, j, n;
    int isPrime[size];
    n = (sqrt)(num);
    isPrime[0] = 0;
    isPrime[1] = 0;
    for(i = 2; i <= num; i++) {
        isPrime[i] = 1;
    }
    
    for(i = 2; i <= n; i++) {
        if(isPrime[i] == 1) {
            for(j = i * i; j <= num; j+= i) {
                isPrime[j] = 0;
            }
        }
    }
    for(i = 2; i <= num; i++) {
        if(isPrime[i] == 1) {
            count++;
        }
    }
    return count;
}

int main(){
    int g, n, result; 
    scanf("%d",&g);
    for(int a0 = 0; a0 < g; a0++){ 
        scanf("%d",&n);
        result = seive(n);
        if(result % 2 == 0) {
            printf("Bob\n");
        }
        else {
            printf("Alice\n");
        }
    }
    return 0;
}