#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    // generate primes
    vector<long> primes;
    primes.push_back(2);
    for(long i=3; i <= 100000; i++)
    {
        bool prime = true;
        for(long j=0; j<primes.size() && primes[j]*primes[j] <= i; j++)
        {
            if(i % primes[j] == 0)
            {
                prime=false;
                break;
            }
        }
        if(prime) 
        {
            primes.push_back(i);
        }
    }
    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        long n;
        cin >> n;
        
        int mid = primes.size();
        for (int k = 0; k < primes.size(); ++k) {
            if (primes[k] > n) {
                mid = k;
                break;
            }
        }
      
        if (n < 2) {
            cout << "Bob" << endl;
        }
        else if (mid % 2 == 0) {
            (cout << "Bob" << endl);
        } else {
            (cout << "Alice" << endl);
        }
        
    }
    return 0;
}