#include <algorithm>
#include <string>
#include <iostream>
#include <vector>

using namespace std;

typedef vector<int> V;

V makePrimes(const int n) {
    V v;
    v.push_back(2);
    for (int i=3; i<=n; ++i) {
        bool isPrime = true;
        for (auto p : v) {
            if (i%p == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime) {
            v.push_back(i);
        }
    }
    return v;
}

string game(const int n, const V& primes) {
    if (n == 1) {
        return "Bob";
    }
    
    const auto it = upper_bound(primes.begin(), primes.end(), n);
    const auto count = it-primes.begin();
    return count&1 ? "Alice" : "Bob";
}

int main(int argc, const char * argv[]) {
    // read inputs
    int n;
    cin >> n;
    V inputs(n);
    int maxN = 0;
    for (int i=0; i<n; ++i) {
        cin >> inputs[i];
        if ((i == 0) || (inputs[i] > maxN)) {
            maxN = inputs[i];
        }
    }
    
    const V primes = makePrimes(maxN);
    
    for (size_t i=0; i<inputs.size(); ++i) {
        cout << game(inputs[i], primes) << endl;
    }

    return 0;
}