#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool isPrime[100000 + 10];

int find(int N)
{
    int ct = 1;
    
    for (int i = 2; i <= N; i++)
        isPrime[i] = true;
    
    for (int i = 2; i * i <= N; i++)
        if (isPrime[i])
            for (int j = i * i; j <= N; j += (2 * i))
                isPrime[j] = false;
    
    for(int i = 3; i <= N; i+=2)
        if(isPrime[i]) ct++;
     return ct;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int tc, N;
    scanf("%d",&tc);
    while(tc--)
    {
        scanf("%d",&N);
        if(N == 1) {printf("Bob\n"); continue;}
        int pcnt = find(N);
        if(pcnt % 2 == 0) printf("Bob\n");
        else printf("Alice\n");
    }
    return 0;
}