// In the name of Allah the most Merciful.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAX = 1e5+100;
vector<ll>primes;
bool isPrime[MAX];

void seive()
{
    for(int i=0;i<MAX;i++)isPrime[i] = true;

    isPrime[0] = false;
    isPrime[1] = false;

    for(int i=2;i<MAX;i++){

        for(int j=2;i*j<MAX;j++){

            if(isPrime[i]==true)isPrime[i*j] = false;
        }
        if(isPrime[i]==true)primes.push_back(i);
    }

   // cout << primes.size() << endl;

}

int main(void)
{

    seive();
    //cout << primes[0] << endl;
    int t;
    cin >> t;

    while(t--){

        int n , counter = 0;

        cin >> n;

        for(int i=0;primes[i]<=n;i++){

            counter++;
            //cout << "YES" << endl;
        }
        if(counter == 0)cout << "Bob" << endl;
        else if(counter%2==0)cout << "Bob" << endl;
        else cout << "Alice" << endl;

    }

    return 0;
}