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

typedef long long ll;

vector < int > ash;

void SieveOfEratosthenes(int n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }


    for (int p=2; p<=n; p++)
       if (prime[p])
          ash.push_back(p);
}

int main()
{
    SieveOfEratosthenes(100100);
    int len = ash.size();
    int t;
    cin >> t;
    while( t--){
        int n;
        cin >> n;
        int cnt = 0;
        for(int i=0; ash[i]<=n; i++){
            cnt++;
        }
        if( !( cnt%2 ))
            cout << "Bob\n";
        else
            cout << "Alice\n";

    }

    return 0;
}