#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> prime;
void sieve(){
    
    prime[0] = prime[1] = 0;
    for(int i = 2; i < 100010;i++){
        if(prime[i]){
            
            for(long long j = i * 1LL * i; j < 100010; j+=i)
                prime[j] = 0;
            
        }
        
    }
    for(int i = 1 ; i < 100010 ; i++) prime[i] += prime[i - 1];
    
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    prime.assign(100010,1);
    sieve();
    int g;
    cin >> g;
    while(g--){
        
        cin >> n;
        if(prime[n] % 2 == 1) cout << "Alice\n";
        else cout << "Bob\n";
            
        
    }
    return 0;
}