#include<iostream>
#include<vector>
using namespace std;
vector<bool>prime(100001,true);
void SieveOfEratosthenes(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.
  
 
    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;
        }
    }
 
  
}


void primecount(int n)
    {
    int counter=0;
     for(int i=0;i<=n;i++)
         {
         if(prime[i])
             counter++;
     }
    if(counter%2!=0)cout<<"Alice"<<endl;
    else
        cout<<"Bob"<<endl;
}

void solve()
{
 int n;
 cin>>n;
    
   
 primecount(n);

}
int main()
{
 int t;SieveOfEratosthenes(1000000);
 cin>>t;
 while(t--)
  solve();
 return 0;

}