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


int main() {
    int largest_n = 100000;
    vector<int> primes;
    primes.push_back(2);
    primes.push_back(3);

    for (int i = 5; i <= largest_n; i++) {
        bool is_prime = true;
        for (const int& k : primes) {
            if (i % k == 0) {
                is_prime = false;
                break;
            }
        }
        if (is_prime) {
            primes.push_back(i);
        }
    }

    int g;
    cin >> g;
    for (int i = 0; i < g; i++) {
        int n;
        cin >> n;
        if (n < 2) {
            cout << "Bob" << endl;
        } else if (n >= primes.back()) {
            cout << (primes.size() % 2 == 0 ? "Bob" : "Alice") << endl;
        } else {
            for (int k = 0; k < primes.size(); k++) {
                if (primes[k] > n) {
                    cout << (k % 2 == 0 ? "Bob" : "Alice") << endl;
                    break;
                }
            }
        }

    }
    return 0;
}