#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(){
    int g;
    cin >> g;
    
    bitset<100001> primes;
    primes.set(); //Set all to 1
    primes.set(1, false); //1 is not a prime
    for (int i = 2; i <= 100000; i++){
        if (primes.test(i)){
            for (int j = i + i; j <= 100000; j += i)
                primes.set(j, false);
        }
    }
    
    bitset<100001> aliceWins;
    //aliceWins.set();
    int numPrimes = 0;
    bool aliceWillWin = false;
    for (int i = 1; i <= 100000; i++){
        if (primes.test(i)){
            numPrimes++;
            //If there is an even number of primes, Bob wins
            if (numPrimes % 2 == 0)
                aliceWillWin = false;
            else //Else alice wins
                aliceWillWin = true;
        }
        aliceWins.set(i, aliceWillWin);
    }
    
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        
        if (aliceWins.test(n))
            cout << "Alice" << endl;
        else
            cout << "Bob" << endl;
    }
    return 0;
}