#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

int getPrimeCount(int n)
{
    bool prime[n+1];
    int count = 0;
    memset(prime, true, sizeof(prime));
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    for (int p=2; p<=n; p++)
        if (prime[p])
            count++;
    return count; 
}
 

int main() {
    int n; 
    cin>>n;
    for(int i=0; i<n; i++) {
        int t;
        cin>>t;
        cout<<(getPrimeCount(t) % 2 ==0 ? "Bob" : "Alice")<<endl;
    }
    return 0;
}