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

int Sieve(int n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
    int m=0;
    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])
          m++;
      return m;
}
int main()
{
    int g;
    cin >> g;
    int i;
    for (i=0; i < g; i++)
    {
        int n;
        cin >> n;
        if (n==1)
        {
            cout << "Bob" << endl;
        }
        else if (n==2)
        {
            cout << "Alice" << endl;
        }
        else
        {
            if (Sieve(n)%2==0)
            {
                cout << "Bob" << endl;
            }
            else
            {
                cout << "Alice" << endl;
            }
        }
    }
return 0;
}