// C++ program to print all primes smaller than or equal to
// n using Sieve of Eratosthenes
#include <bits/stdc++.h>
using namespace std;
 
void SieveOfEratosthenes(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 (long 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 (long int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    // Print all prime numbers
    long int count =0;
    for (long int p=2; p<=n; p++)
       if (prime[p])
          count++;
    if(count%2==0)
    {
        cout<<"Bob"<<endl;
    }
    else
    {
        cout<<"Alice"<<endl;
    }
}
 
// Driver Program to test above function
int main()
{
    int t;
    cin>>t;
    for(int i=0;i<t;i++)
    {
    long int n ;
    cin>>n;
   // cout << "Following are the prime numbers smaller "
    //     << " than or equal to " << n << endl;
    SieveOfEratosthenes(n);
    }
    return 0;
}