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

long int SieveAndCount(long int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    memset(prime, true, sizeof(prime));

    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
    long int counter=0;
    // count all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
          counter++;
    return counter;
}

int main()
{
    ios::sync_with_stdio(false);
    int g;
    cin>>g;
    while(g--)
    {
        long int n;
        cin>>n;
        if(SieveAndCount(n)%2==0)
            cout<<"Bob\n";
        else
            cout<<"Alice\n";
    }
    return 0;
}