#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    vector<bool> prime(100001, true);
    
    for (int i = 2; i < 100001; ++i)
        if (prime[i])
            for (int j = 2; i * j < 100001; ++j)
                prime[i*j] = false;
    
    vector<int> numPrimes(100001);
    numPrimes[1] = 0;
    for (int i = 2; i < 100001; ++i) {
        numPrimes[i] = numPrimes[i-1];
        if (prime[i])
            numPrimes[i]++;
    }
    
    int G;  cin>>G;
    
    while(G--) {
        int N;  cin>>N;
        
        if (numPrimes[N] % 2)
            cout<<"Alice"<<endl;
        else
            cout<<"Bob"<<endl;
    }
    
    return 0;
}