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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t, counter;
    vector<int> in;
    for (int i = 1; i <= 1000000; i++) {
        bool isPrime = true;
        if (i == 1)
            isPrime = false;
        for (int j = 2; j <= sqrt(i); j++) {
            if (i % j == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime)
            in.push_back(i);
    }
    cin>>t;
    while (t--) {
        int n;
        counter = 0;
        cin >> n;
        for (int i = 0; in[i] <= n; i++)
            counter++;
        if (counter % 2 == 0)
            cout << "Bob" << endl;
        else
            cout << "Alice"<<endl;
    }
    return  0;
}