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


int main() {
    const int N = 100000;
    vector<bool> p(N + 1);
    vector<int> primes;
    for (int i = 2; i <= N; i++) {
        if (p[i])
            continue;
        primes.push_back(i);
        for (int j = i; j <= N; j+= i) 
            p[j] = true;
    }
    int g;
    cin >> g;
    while (g-- > 0) {
        int n;
        cin >> n;
        int x = upper_bound(primes.begin(), primes.end(), n) - primes.begin();
        cout << (x & 1 ? "Alice" : "Bob") << endl;
    }
    return 0;
}