#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;


vector<int> countSieve(int n) {
    vector<int> sieve(n, 0);
    
    vector<int> count(n, 0);
    
    int counter = 0;
    for (int i = 2; i /** i*/ < n; i++) {
        if (sieve[i] == 0) {
            counter++;
            
            long long f = i;
            for (long long j = f * f; j < n; j += i) {
                sieve[j] = 1;
            }
        }
        
        count[i] = counter;
    }
    
    return count;
}


int main(){
    
    auto count = countSieve(100001);
    /*
    for (auto i : count) {
        cout << i << endl;
    }*/
    
    int g;
    cin >> g;
    for(int a0 = 0; a0 < g; a0++){
        int n;
        cin >> n;
        // your code goes here
        
        if (count[n] % 2 == 0) {
            cout << "Bob" << endl;
        } else {
            cout << "Alice" << endl;
        }
    }
    return 0;
}