#include <bits/stdc++.h>

using namespace std;

const int mx = 1e5 + 5;
int acc[mx];
bool prime[mx];
void pre(){
    memset(prime, true, sizeof(prime));
    memset(acc, 0, sizeof (acc));
    prime[0] = prime[1] = false;
    for(int i = 2; i * i < mx;i ++){
        if(prime[i]){
            for(int j = i*2; j < mx; j+=i){
                prime[j] = false;
            }    
        }
    }
    for(int i = 1; i < mx; i++){
        acc[i] += acc[i - 1];
        if(prime[i]) acc[i]++;
    }
}
int main() {
    pre();
    int t, n;
    cin >> t;
    while(t--){
        cin >> n;
        cout << (acc[n] % 2 == 0  ? "Bob" : "Alice") << endl;
        
    }
    return 0;
}