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


vector<int> cache = {2};

bool is_prime(int n)
{
    if(std::binary_search(cache.begin(),cache.end(),n))
        return true;
    if(cache.back() > n)
        return false;

    for(auto d = cache.begin(); d != cache.end() && (*d < (int)sqrt(n)+1); ++d)
        if(n % *d == 0)
            return false;

    cache.push_back(n);
    return true;
}



int primes_num(int n)
{
    auto p = lower_bound(cache.begin(),cache.end(),n);
    int r = std::distance(cache.begin(),p);

    for (auto i = *(p-1)+1; i < n+1; ++i)
        if (is_prime(i))
            ++r;


    //cout << r << endl;

    return r;
}

int main() {
    int g;
    cin >> g;
    while(g-->0)
    {
        int n;
        cin >> n;
        cout << ((primes_num(n) % 2 == 1) ? "Alice" : "Bob") << endl;
    }
    return 0;
}