#include <cmath>
#include <cstdio>
#include<stdbool.h>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#include<stack>

int main() 
{
    
    int x,n;
    cin>>x;
    while(x--)
    {
        
        cin>>n;
        stack<int> s;
        //cout<<n<<" ";
        if(n==1)
        {
            cout<<"Bob"<<endl;
            //return 0;
        }
        else if(n==2)
        {
            cout<<"Alice"<<endl;
            //return 0;
        }
        else
        {
        
        /*for(int i=2; i<=n; i++)
	   {
		int count=0;
		for(int j=2; j<i; j++)
		{
			if(i%j==0)
			{
				count++;
				break;
			}
		}
		if(count==0)
		{
			s.push(i);
		}
	   }*/
            
          n+= 1;
            bool *primes = (bool*)calloc(n, sizeof(bool));

            unsigned int sqrtlim = sqrt(n);
            for (int i = 2; i <= sqrtlim; i++)
                if (!primes[i])
                    for (int j = i * i; j < n; j += i)
                        primes[j] = true;

//    printf("\nListing prime numbers between 2 and %d:\n\n", lim - 1);
          for (int i = 2; i < n; i++)
                 if (!primes[i])
                    s.push(i);  
            
        long int q=s.size();
        //cout<<q<<"^";
        if(q%2==0)
        {
            cout<<"Bob"<<endl;
        }
        else
            cout<<"Alice"<<endl;
        }
        
    }
    return 0;
}