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


int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    
    int maximum = *max_element(a.begin(), a.end());
    
    
    vector<int> primes(maximum+1, 1);
    primes[1] = primes[0] = 0;
    
    for(int i=2; i*i<=maximum; i++){
        if (primes[i] == 0) continue;

        for(int j=2; j*i<=maximum; j++){
            primes[j*i] = 0;
        }
    }
    
    for(int i=1; i<=maximum; i++){
        primes[i] += primes[i-1];
    }
    
    for(int i=0; i<n; i++){
        cout << ((primes[a[i]] & 1) ? "Alice" : "Bob") << endl;
    }
    
    return 0;
}