#include <bits/stdc++.h>

using namespace std;

int is_prime[500005];
int spart[500005];

vector<int> prime;
void precalc()
{
    int Nmax = 200005;
    prime.push_back(2);
    for(int i = 3; i <= Nmax; i+= 2)
        if(is_prime[i] == 0) {
            prime.push_back(i);
            for(int j = 3; i * j <= Nmax; j += 2)
                is_prime[i*j] = 1;
        }
}

int main()
{
    precalc();
    for(int i = 0; i < prime.size(); ++i)
        spart[prime[i]] = 1;
    for(int i = 2; i <= 100005; ++i)
        spart[i] += spart[i-1];

    int T,k;
    cin >> T;
    while(T--){
        cin >> k;
        int nr = spart[k];
        if(nr % 2 == 0)
            cout <<"Bob\n";
        else
            cout <<"Alice\n";
    }

    return 0;
}