#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int alice(int a[100000],int n)
    {
    int i,j,k=0;
   // cout<<n<<endl;

   for(i=1;i<=n;i++)
       {
       if(a[i]==1)
           {
           k++;
       }
   }
    return k;
   
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int t;
    cin>>t;
    while(t--)
        {
        int n;
        cin>>n;
            if(n==1)
                {
                cout<<"Bob"<<endl;
                continue;
            }
        int a[n]={0};
           
        int i,j,isPrime=0;
        a[2]=1;
        
         for(i=2; i<=n; i++)
    {
        /* Assume that the current number is Prime */
        isPrime = 1; 
 
        /* Check if the current number i is prime or not */
        for(j=2; j<=i/2; j++)
        {
            /*
             * If i is divisible by any number other than 1 and self
             * then it is not prime number
             */
            if(i%j==0)
            {
                isPrime = 0;
                break;
            }
        }
 
        /* If the number is prime then print */
        if(isPrime==1)
        {
            a[i]=1;
        }
    }
     
   // cout<<n;
    int k=1,count=0;

        k=alice(a,n);
  //  cout<<k;
    if(k%2==0)
        cout<<"Bob"<<endl;
    else
        cout<<"Alice"<<endl;
        
    }
    return 0;
}