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

bool sieve[100001];

int main() {
    vector<int> primes;
    for (int i = 2; i < 100001; i++) {
        if (!sieve[i]) {
            primes.push_back(i);
            for (int j = i + i; j < 100001; j += i)
                sieve[j] = true;
        }
    }
    int g;
    cin >> g;
    while (g--) {
        int n;
        cin >> n;
        auto it = upper_bound(primes.begin(), primes.end(), n);
        int num_of_primes;
        if (it == primes.end())
            num_of_primes = primes.size();
        else
            num_of_primes = it - primes.begin();
        if (num_of_primes % 2)
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
    }
    return 0;
}