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

const int kMaxN = 100000;

bool IsPrime(int n)
{
    if (n <= 1)
        return false;
    for (int i = 2; i * i <= n; ++i)
        if (n % i == 0)
            return false;
    return true;
}

int main() {
    vector<int> distinct(kMaxN + 1, 0);
    int t, nmax = 0;    
    
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        
        if (n > nmax) {
            for (int i = nmax + 1; i <= n; ++i) {
                if (IsPrime(i))
                    ++distinct[i];
                distinct[i] += distinct[i - 1];
            }
            nmax = n;
        }
        
        cout << ((distinct[n] % 2 == 0) ? "Bob" : "Alice") << "\n";
    }
    
    return 0;
}