#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const int n_max = 100010;

int P[n_max];
int n, n_test;

void init() {
    fill_n(P, n_max, 1);
    P[0] = P[1] = 0;
    
    for (int i = 2; i < n_max; ++i) {
        if (P[i])
            for (int j = i * 2; j < n_max; j += i) P[j] = 0;
            
        P[i] += P[i - 1];
    }
}

int main() {
    init();
    
    cin >> n_test;
    while (n_test--) {
        cin >> n;
        cout << (P[n] % 2 == 1 ? "Alice" : "Bob") << "\n";
    }
    
    return 0;
}