#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(){
    vector<bool> sieve(100001, true);
    sieve[0] = sieve[1] = false;
    for (int i = 2; i < 317; ++i) {
        if (sieve[i]) {
            for (int j = i * i; j < 100001; j += i) {
                sieve[j] = false;
            }
        }
    }
    
    vector<int> numPrimes(100001, 0);
    for (int i = 1; i < 100001; ++i) {
        if (sieve[i])
            numPrimes[i] = numPrimes[i - 1] + 1;
        else
            numPrimes[i] = numPrimes[i - 1];
    }
    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        if (numPrimes[n] % 2 == 0)
            cout << "Bob" << endl;
        else
            cout << "Alice" << endl;
    }
    return 0;
}