#include <bits/stdc++.h>
using namespace std;

int isPrime[100001];

void seive()
{
    memset(isPrime, 1, sizeof(isPrime));
    isPrime[0] = isPrime[1] = 0;
    for(int i= 2; i <= 1000; i++)
    {
        if(isPrime[i])
        {
            for(int j = i * i; j <= 100000; j += i)
                isPrime[j] = 0;
        }
    }
}

int main()
{
    seive();
    for(int i = 2; i <= 100000; i++)
        isPrime[i] += isPrime[i - 1];
    int g, n;
    cin >> g;
    for(int i = 1; i <= g; i++)
    {
        cin >> n;
        if(isPrime[n] % 2 == 0)
            cout << "Bob" << endl;
        else
            cout << "Alice" << endl;
    }
   return 0;
}