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


int main() {
    int N = 100001;
    vector<bool> eratosfen(N, true);
    eratosfen[0] = false;
    eratosfen[1] = false;
   
    for (int i = 2; i < N; ++i)
    {
        if (eratosfen[i])
        {
        for (int k = 2*i; k < N; k+=i)
            eratosfen[k] = false;
        }
    } 
    
    vector<int> primes_count(N);
    
    int k = 0;
    for (int i = 0; i < N; ++i) {
        if (eratosfen[i])
            ++k;
        primes_count[i] = k;
    }
    
    int g;
    cin >> g;
    
    for (int i = 0; i < g; ++i) {
        int x;
        cin >> x;
        bool b = primes_count[x] % 2;
        
        string s =  b ? "Alice" : "Bob";
        cout <<s<< endl;
        
        
    }
    return 0;
}